#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long MAX = 1e18 + 1;
const double pi = 3.1415926535897932384626433832;
const long long M = 1e9 + 7;
long long modpow(long long x, long long n, long long mod1) {
  if (n == 0) return 1 % mod1;
  long long u = modpow(x, n / 2, mod1);
  u = (u * u) % mod1;
  if (n % 2 == 1) u = (u * x) % mod1;
  return u;
}
long long POW(long long x, long long y) { return modpow(x, y, LONG_LONG_MAX); }
long long MI(long long x, long long mod = M) { return modpow(x, mod - 2, mod); }
long long gcd(long long x, long long y) {
  if (x == 0)
    return y;
  else
    return gcd(y % x, x);
}
long long lcm(long long x, long long y) { return (x * y) / gcd(x, y); }
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6) {
    if (n % i == 0 || n % (i + 2) == 0) {
      return false;
    }
  }
  return true;
}
bool sumdigits(long long a) {
  long long result = 0;
  while (a > 0) {
    result += a % 10;
    a /= 10;
  }
  return result;
}
const long long Node = 2e5 + 7;
vector<long long> adj[Node];
bool vis[Node] = {false};
void addedge(long long u, long long v) {
  adj[u - 1].push_back(v - 1);
  adj[v - 1].push_back(u - 1);
}
void dfs(long long u) {
  vis[u] = true;
  for (auto x : adj[u]) {
    if (!vis[x]) {
      dfs(x);
    }
  }
}
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
void seive(long long prime[], long long n) {
  long long chk = 2;
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i] == 0) {
      for (long long j = i * i; j <= n; j += i) prime[j] = 1;
    }
  }
}
const long long NC = 100005, MOD = M;
long long inv[NC], fac_inv[NC], fac[NC];
void initialize() {
  long long i;
  inv[1] = 1;
  for (i = 2; i <= NC - 2; i++) inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
  fac[0] = fac[1] = 1;
  for (i = 2; i <= NC - 2; i++) fac[i] = i * fac[i - 1] % MOD;
  fac_inv[0] = fac_inv[1] = 1;
  for (i = 2; i <= NC - 2; i++) fac_inv[i] = inv[i] * fac_inv[i - 1] % MOD;
}
long long ncr(long long n, long long r) {
  if (n < r) return 0;
  return (fac[n] * fac_inv[r] % MOD) * fac_inv[n - r] % MOD;
}
void solve() {
  long long n;
  cin >> n;
  cout << 2 * n - 1 << " " << 2 << endl;
  cout << 1 << " " << 2 << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
