#include <bits/stdc++.h>
int w[11] = {1, 2};
int dp[1234567];
int main() {
  dp[0] = 1;
  for (int i = 0; i < 2; i++) {
    for (int j = w[i]; j <= 200000; j++) {
      dp[j] += dp[j - w[i]];
    }
  }
  dp[0] = -1;
  int n;
  scanf("%d", &n);
  printf("%d 2\n", std::lower_bound(dp, dp + 200001, n) - dp);
  printf("1 2\n");
  return 0;
}
