#ifdef LOCAL111 #define _GLIBCXX_DEBUG #else #pragma GCC optimize ("O3") #define NDEBUG #endif // #define _USE_MATH_DEFINES #include const int INF = 1e9; using namespace std; template ostream& operator<< (ostream& os, const pair& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; } #define endl '\n' #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #ifdef LOCAL111 #define DEBUG(x) cout<<#x<<": "<<(x)< void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} #else #define DEBUG(x) true template void dpite(T a, T b){ return; } #endif #define F first #define S second #define SNP string::npos #define WRC(hoge) cout << "Case #" << (hoge)+1 << ": " template void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} template bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} template bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} template vector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template typename enable_if::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v(e,v...); } const array dx = {0, 1, 0, -1}; const array dy = {1, 0, -1, 0}; typedef long long int LL; typedef unsigned long long ULL; typedef pair P; void ios_init(){ //cout.setf(ios::fixed); //cout.precision(12); #ifdef LOCAL111 return; #endif ios::sync_with_stdio(false); cin.tie(0); } int main() { ios_init(); LL k; while(cin >> k) { vector num(2, 1); vector

edge; while(num.back() * 2 <= k) { num.push_back(num.back() * 2); } reverse(ALL(num)); REP(i, SZ(num)) FOR(j, i + 1, SZ(num)) { edge.emplace_back(i + 2, j + 2); } REP(i, SZ(num)) { if(k >= num[i]) { edge.emplace_back(1, i + 2); k -= num[i]; } } cout << SZ(num) << ' ' << SZ(edge) << endl; sort(ALL(edge)); REP(i, SZ(edge)) { cout << edge[i].F << ' ' << edge[i].S << endl; } } return 0; }