#ifdef ONLINE_JUDGE #include #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif using namespace std; // lambda : [] (int a, int b) -> bool { body return } // string r_str = R"(raw string)" #define mp make_pair #define mt make_tuple #define eb emplace_back #define pb push_back #define fi first #define se second #define LL long long #define ULL unsigned long long #define PI (atan(1) * 4) #define BASE 73 #define NMAX 10000 #define NMAX2 20001 #define MOD1 1000000007 #define ALL(V) (V).begin(), (V).end() #define ALLR(V) (V).rbegin(), (V).rend() #define CRLINE Duxar(__LINE__); #define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl; #define ENTER putchar('\n'); int dx4[] = {-1, 0, 1, 0}; int dy4[] = {0, 1, 0, -1}; int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1}; int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1}; void Duxar(int _this_line) { #ifndef ONLINE_JUDGE printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line); #endif } bool AreEqual(double a, double b) { return (fabs(a - b) < 1e-10); } template bool GetNr(T &_value) { T _sign = 1; char ch; _value = 0; while(!isdigit(ch = getchar())) { if (ch == -1) { return false; } ch == '-' ? _sign = -1 : _sign = 1 ; } do { _value = _value * 10 + (ch - '0'); } while(isdigit(ch = getchar())); _value *= _sign; return true; } template void PutNr(T _value, char _ch = ' ') { cout << _value << _ch; } int N; bool Ask(int x, int y) { printf("1 %d %d\n", x, y); fflush(stdout); scanf("%d", &x); return x; } int main(){ string fileInput = "sum"; #ifdef INFOARENA freopen((fileInput + ".in").c_str(), "r", stdin); freopen((fileInput + ".out").c_str(), "w", stdout); #else #ifndef ONLINE_JUDGE // freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin); // freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/result", "w", stdout); #endif #endif int i, pw; vector ans; scanf("%d", &N); for (i = 1; i <= N; ++i) { int st = i, en = i; ans.pb(st); for (pw = 2; st + pw - 1 <= N; pw <<= 1) { int aux = st + pw - 1; if (!Ask(st, aux)) { break; } else { en = aux; } } for (pw >>= 2; pw; pw >>= 1) { if (en + pw <= N) { if (Ask(st, en + pw)) { en = en + pw; } } } i = en; } printf("2 %d", ans.size()); for (auto x: ans) { printf(" %d", x); } return 0; }