#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-9;
const int mod = 1e9 + 7;
int dp[N];
int main() {
  dp[0] = 1;
  int num;
  while (scanf("%d", &num) != EOF) {
    bool flag = 0;
    if (num == 1) {
      printf("1 1\n");
      printf("1\n");
      return 0;
    }
    int ans, cnt;
    for (int i = 1; i <= 2; i++) {
      for (int j = 0; j < N; j++) {
        if (j >= i) {
          dp[j] += dp[j - i];
        }
        if (dp[j] == num) {
          ans = j;
          cnt = i;
          flag = 1;
          break;
        }
      }
      if (flag) {
        printf("%d %d\n", ans, cnt);
        if (cnt == 1)
          printf("1\n");
        else
          printf("1 2\n");
        break;
      }
    }
  }
  return 0;
}
