#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("omit-frame-pointer")
#pragma GCC optimize("unroll-loops")
const int MAXINT = 2147483640;
const long long MAXLL = 9223372036854775800LL;
const long long N = 1000000;
const double pi = 3.1415926535897932384626433832795;
using namespace std;
long long dp[2000001];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  srand(time(0));
  long long sum;
  cin >> sum;
  dp[0] = 1;
  for (int i = 1; i <= 2 * N; i++) dp[i] = 1;
  for (int i = 2; i <= 2 * N; i++) dp[i] += dp[i - 2];
  for (int i = 1; i <= 2 * N; i++)
    if (dp[i] == sum) {
      cout << i << " 2" << endl;
      cout << "1 2" << endl;
      return 0;
    }
  return 0;
}
