#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
int A, f[maxn];
int main() {
  scanf("%d", &A);
  int lmt;
  memset(f, 0, sizeof(f));
  f[0] = 1;
  for (int i = 1; i <= 10; i++)
    for (int j = i; j <= 1000000; j++) {
      if (f[j - i] > 1e5) continue;
      f[j] += f[j - i];
      if (f[j] == A) {
        printf("%d %d\n", j, i);
        for (int k = 1; k <= i; k++) printf("%d ", k);
        return 0;
      }
    }
  return 0;
}
