Problem: Attention: we lost all the test cases for this problem, so instead of solving the problem, we need you to generate test cases. We're going to give you the answer, and you need to print a test case that produces the given answer. The original problem is in the following paragraph.

People don't use cash as often as they used to. Having a credit card solves some of the hassles of cash, such as having to receive change when you can't form the exact amount of money needed to purchase an item. Typically cashiers will give you as few coins as possible in change, but they don't have to. For example, if your change is 30 cents, a cashier could give you a 5 cent piece and a 25 cent piece, or they could give you three 10 cent pieces, or ten 1 cent pieces, two 5 cent pieces, and one 10 cent piece. Altogether there are 18 different ways to make 30 cents using only 1 cent pieces, 5 cent pieces, 10 cent pieces, and 25 cent pieces. Two ways are considered different if they contain a different number of at least one type of coin. Given the denominations of the coins and an amount of change to be made, how many different ways are there to make change?

As we mentioned before, we lost all the test cases for this problem, so we're actually going to give you the number of ways, and want you to produce a test case for which the number of ways is the given number. There could be many ways to achieve this (we guarantee there's always at least one), so you can print any, as long as it meets the constraints described below.

Input

Input will consist of a single integer A (1 ≤ A ≤ 105), the desired number of ways.

Output

In the first line print integers N and M (1 ≤ N ≤ 106, 1 ≤ M ≤ 10), the amount of change to be made, and the number of denominations, respectively.

Then print M integers D1, D2, ..., DM (1 ≤ Di ≤ 106), the denominations of the coins. All denominations must be distinct: for any i ≠ j we must have Di ≠ Dj.

If there are multiple tests, print any of them. You can print denominations in atbitrary order.

Examples

Input

18


Output

30 4
1 5 10 25


Input

3


Output

20 2
5 2


Input

314


Output

183 4
6 5 2 139

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
public class Wtf {
    public static void main(String[] args) throws IOException {

        Ifmo ifmo = new Ifmo();
    }

}
class Ifmo {

    ArrayList<Pair> Graph[], pref[];
    int n, l, m, primes, timer, log_n;
    char[][] field;
    ArrayList<FUCKINGVERTEX> Ribs;
    int[][] roofs, ans, up, c;
    Vertex[][] highes;
    ArrayList<Integer> fin;
    static int cur;
    int[] p, size, tin, tout;
    boolean[] used;
    int logn;
    int[][] longest;
    int[][][] dp = new int[31][31][51];
    long mod;
    int[] parent;
    HashMap<Integer, Long>[] tree, bit;
    Ifmo() throws IOException {

  //      FScanner fs = new FScanner(new FileReader("input.txt"));
         FScanner fs = new FScanner(new InputStreamReader(System.in));
//        PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
        PrintWriter pw = new PrintWriter(System.out);
        int n = fs.nextInt();
        int[] mas = new int[10];
        for (int i =0 ; i<10; i++)
            mas[i] = (int) Math.pow(2, i);
        if (n == 1) {
            System.out.println(1 + " " + 1);
            System.out.println(1);
            System.exit(0);
        }
            if (n == 2) {
                System.out.println(2 + " " + 2);
                System.out.println(1 + " " + 2);
                System.exit(0);
            }
            pw.println(n*2-2 + " " + 2);
            pw.println(1 + " " + 2);
            pw.close();
            System.exit(0);
    }

    public  long mem() {
        Runtime runtime = Runtime.getRuntime();
        return runtime.totalMemory() - runtime.freeMemory();
    }


    int lcp (int i, int j) {
        int ans = 0;
        for (int k=log_n; k>=0; --k)
            if (c[k][i] == c[k][j]) {
                ans += 1<<k;
                i += 1<<k;
                j += 1<<k;
            }
        return ans;
    }


    public long rec(long l, long  r) {
        long fr = (l+r)/2;
        long ans = 1;
        if ((fr & 1) == (l &1))
            ans+=rec(l, fr)*2;
        return ans;
    }
 

    void dfs_combo(int cur, int it,  int[] p, int[] q) {
        used[cur] = true;
        if (q[cur] == -1 || q[cur] == p[cur]);
    }
 
    void dfs(int cur, int[] mas, HashMap<Integer, Integer> numofv, HashMap<Integer, HashSet<Integer>> fullis, HashSet<Integer> currents, ArrayList<Integer>[] bin) {
        used[cur] = true;
        if (bin[mas[cur]].size() == 0)
            primes++;
        else {
            currents.add(mas[cur]);
            for (int i = 0; i<bin[cur].size(); i+=2) {
                int val = bin[cur].get(i);
                int how = bin[cur].get(i+1);
                if (numofv.containsKey(val)) {
 
                }
            }
        }
 
 
    }

    void make_set (int v) {
        parent[v] = v;
    }
 
    int find_set (int v) {
        if (v == parent[v])
            return v;
        return parent[v] = find_set (parent[v]);
    }
 
    void union_sets (int a, int b) {
        a = find_set(a);
        b = find_set(b);
        parent[a] = b;
 
    }
    boolean upper(int a, int b) {
        return tin[a]<=tin[b] && tout[a]>=tout[b];
    }
 
    int lca(int a, int b) {
        if (upper(a, b)) return a;
        if (upper(b, a)) return b;
        for (int i = logn-1; i>=0; i--) {
            if (!upper(up[a][i], b))
                a = up[a][i];
        }
        return up[a][0];
    }
 
 
 
    int log_2(int g) {
        int s = 1;
        int ans = 0;
        while (g>=s)
        {
            ans++;
            s*=2;
        }
        return ans;
    }
 
    int dsu_get(int v) {
        if (v == parent[v])
            return v;
        return parent[v] = find_set (parent[v]);
    }
 
    void dsu_unit(int a, int b) { // a or dsu_get(a)? what's your choice?
        if (a!=b) {
            if (size[b]>size[a])
            {
                int q = a;
                a = b;
                b = q;
            }
            p[b] = a;
            size[a]+=size[b];
        }
    }
    int gcd (int a, int b) {
        if (b == 0)
            return a;
        else
            return gcd (b, a % b);
    }
}

class forStr {
    int a, b, size;
    forStr(int a1, int b1, int size1) {
        a = a1;
        b = b1;
        size = size1;
    }
}
class Pair implements Comparable<Pair> {
    int  y;
    int x, z;
    Pair(int x1, int y1, int z1) {
        x = x1;
        y = y1;
        z = z1;
    }


    @Override
    public int compareTo(Pair o) {
        if (x == o.x)
        return -Integer.compare(y, o.y);
        else return Integer.compare(x, o.x);
    }
}

class Lines implements Comparable<Lines> {
    int pos;
    boolean start;
    Lines(int x, boolean f) {
        pos = x;
        start = f;
    }

    @Override
    public int compareTo(Lines o) {
        return Integer.compare(pos, o.pos);
    }
}

class Vertex implements Comparable<Vertex> {
    int  b, c;
    int a;
    Vertex(int a1, int b1, int c1) {
        a = a1;
        b = b1;
        c = c1;
    }

    @Override
    public int compareTo(Vertex o) {
        return Long.compare(c, o.c);
    }
}

class FUCKINGVERTEX implements Comparable<FUCKINGVERTEX> {
    int a, b, c, d;
    FUCKINGVERTEX(int a1, int b1, int c1, int d1) {
        a = a1;
        b = b1;
        c = c1;
        d = d1;
    }

    @Override
    public int compareTo(FUCKINGVERTEX o) {
        return Integer.compare(a, o.a);
    }
}
class FScanner {
    StringTokenizer st;
    BufferedReader reader;
    FScanner(InputStreamReader isr) throws IOException {
        reader = new BufferedReader(isr);
    }

    String nextLine() throws IOException {
        return reader.readLine();
    }

    String nextToken() throws IOException{
        while (st == null || !st.hasMoreTokens()) {
            String s = reader.readLine();
            if (s == null)
                return null;
            st = new StringTokenizer(s);
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    char nextChar() throws IOException {
        return (char) reader.read();
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    int[] iarr(int n) throws IOException {
        int[] mas = new int[n];
        for (int i =0 ; i<n; i++)
            mas[i] = nextInt();
        return mas;
    }
    double[] darr(int n) throws IOException {
        double[] mas = new double[n];
        for (int i =0 ; i<n; i++)
            mas[i] = nextDouble();
        return mas;
    }
    char[][] cmas2 (int n, int m) throws IOException {
        char[][] mas = new char[n][m];
        for (int i =0 ; i<n; i++)
            mas[i] = nextLine().toCharArray();
        return mas;
    }
    long[] larr(int n) throws IOException {
        long[] mas = new long[n];
        for (int i =0 ; i<n; i++)
            mas[i] = nextLong();
        return mas;
    }

}