Pagini recente » Cod sursa (job #1706093) | Cod sursa (job #1301326) | Cod sursa (job #649947) | Cod sursa (job #2981435) | Cod sursa (job #2273663)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
#define CHECKRET(x, y) if(!(x)) return (y);
#define SKIP(x) if((x)) continue;
typedef pair<int, int> pii;
#ifdef INFOARENA
#define ProblemName "lacate"
#else
#define ProblemName "fis"
#endif
#define InFile ProblemName ".in"
#define OuFile ProblemName ".out"
int main() {
assert(freopen(InFile, "r", stdin));
assert(freopen(OuFile, "w", stdout));
int N;
scanf("%d", &N);
if (N == 2) {
printf("1 1\n1\n1\n");
return 0;
}
printf("%d %d\n", N, 2);
for (int i = 0; i < N; ++i)
printf("%d %d\n", i + 1, (i + 1) % N + 1);
return 0;
}