Bob is playing a game named "Walk on Matrix".

In this game, player is given an n × m matrix A=(a_{i,j}), i.e. the element in the i-th row in the j-th column is a_{i,j}. Initially, player is located at position (1,1) with score a_{1,1}. 

To reach the goal, position (n,m), player can move right or down, i.e. move from (x,y) to (x,y+1) or (x+1,y), as long as player is still on the matrix.

However, each move changes player's score to the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of the current score and the value at the position he moves to.

Bob can't wait to find out the maximum score he can get using the tool he recently learnt — dynamic programming. Here is his algorithm for this problem. 

<image>

However, he suddenly realize that the algorithm above fails to output the maximum score for some matrix A. Thus, for any given non-negative integer k, he wants to find out an n × m matrix A=(a_{i,j}) such that 

  * 1 ≤ n,m ≤ 500 (as Bob hates large matrix); 
  * 0 ≤ a_{i,j} ≤ 3 ⋅ 10^5 for all 1 ≤ i≤ n,1 ≤ j≤ m (as Bob hates large numbers); 
  * the difference between the maximum score he can get and the output of his algorithm is exactly k. 



It can be shown that for any given integer k such that 0 ≤ k ≤ 10^5, there exists a matrix satisfying the above constraints.

Please help him with it!

Input

The only line of the input contains one single integer k (0 ≤ k ≤ 10^5).

Output

Output two integers n, m (1 ≤ n,m ≤ 500) in the first line, representing the size of the matrix. 

Then output n lines with m integers in each line, a_{i,j} in the (i+1)-th row, j-th column.

Examples

Input


0


Output


1 1
300000

Input


1


Output


3 4
7 3 3 1
4 8 3 6
7 7 7 3

Note

In the first example, the maximum score Bob can achieve is 300000, while the output of his algorithm is 300000.

In the second example, the maximum score Bob can achieve is 7\&3\&3\&3\&7\&3=3, while the output of his algorithm is 2.
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.DecimalFormat;
import java.util.*;

public class Main {

    public static void main(String[] args) throws NumberFormatException, IOException {
        IO io = new IO(null, null);
        int x = io.getNextInt(), x_p = 0;
        int lim = 300*1000;
        for (int i = 0; i <= lim; i++) {
            if((i & x) != 0) continue;
            if((i|x) > lim) continue;
            x_p = i;
        }
        int c = x_p | x;
        Integer [] [] M = {
                {c, c, x_p},
                {x_p, x, c},
                {c, c, x}
        };
        io.println("3 3");
        for(Integer [] row : M)
            io.outputArr(row);
        io.close();
    }
}

class pollardRho{
    private static BigInteger zero = new BigInteger("0");
    private static BigInteger one  = new BigInteger("1");
    private static BigInteger two  = new BigInteger("2");
    private static SecureRandom r = new SecureRandom();
    private static Queue<BigInteger> tasks = new LinkedList<>();
    private static ArrayList<BigInteger> primes = new ArrayList<>();

    public static long getBiggestPrime(long n) {
        long N = n;
        tasks.clear();
        primes.clear();
        tasks.add(BigInteger.valueOf(n));
        while (!tasks.isEmpty()){
            BigInteger x = tasks.poll();
            BigInteger P = one;
            for (BigInteger p : primes)
                if (P.compareTo(p) < 0)
                    P = p;
            for (BigInteger p : primes){
                while (x.remainder(p).equals(zero))
                    x = x.divide(p);
            }
//            System.err.println(x + " " + P);
            if(x.compareTo(P) <= 0) continue;
            factor(x);
        }
        BigInteger P = one;
        for (BigInteger p : primes)
            if (P.compareTo(p) < 0)
                P = p;
//        System.out.println(N + " " + tasks + " " + primes);
        return P.longValue();
    }

    private static void factor(BigInteger N) {
        if (N.compareTo(one) == 0) return;
        if (N.isProbablePrime(20)) {
            primes.add(N);
            return;
        }
        BigInteger d = rho(N);

        if (d.compareTo(one) != 0)
            tasks.add(d);
        N = N.divide(d);
        if (N.compareTo(one) != 0)
            tasks.add(N);
    }

    private static BigInteger rho(BigInteger N) {
        BigInteger d;
        BigInteger c  = new BigInteger(N.bitLength(), r);
        BigInteger p  = new BigInteger(N.bitLength(), r);
        BigInteger q = p;

        if (N.mod(two).compareTo(zero) == 0) return two;

        d = one;
        while(d.compareTo(one) == 0) {
            p  =  p.multiply(p).mod(N).add(c).mod(N);
            q = q.multiply(q).mod(N).add(c).mod(N);
            q = q.multiply(q).mod(N).add(c).mod(N);
            d = p.subtract(q).gcd(N);
        }
        return d;
    }
}
class IO{
    private BufferedReader br;
    private StringTokenizer st;
    private PrintWriter writer;
    private String inputFile,outputFile;

    public boolean hasMore() throws IOException{
        if(st != null && st.hasMoreTokens()) return true;
        if(br != null && br.ready()) return true;
        return false;
    }

    public String getNext() throws FileNotFoundException, IOException{
        while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    public String getNextLine() throws FileNotFoundException, IOException{
        return br.readLine().trim();
    }

    public int getNextInt() throws FileNotFoundException, IOException{
        return Integer.parseInt(getNext());
    }
    public long getNextLong() throws FileNotFoundException, IOException{
        return Long.parseLong(getNext());
    }

    public void print(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f" ,x);
    }
    public void println(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f\n" ,x);
    }
    public void print(Object o) throws  IOException{
        writer.print(o.toString());
    }

    public void println(Object o) throws  IOException{
        writer.println(o.toString());
    }
    public IO(String x,String y) throws FileNotFoundException, IOException{
        inputFile = x;
        outputFile = y;
        if(x != null) br = new BufferedReader(new FileReader(inputFile));
        else br = new BufferedReader(new InputStreamReader(System.in));
        if(y != null) writer = new PrintWriter(new BufferedWriter(new FileWriter(outputFile)));
        else writer = new PrintWriter(new OutputStreamWriter(System.out));
    }

    protected void close() throws IOException{
        br.close();
        writer.close();
    }
    public void outputArr(Object [] A) throws IOException{
        int L = A.length;
        for (int i = 0;i < L;i++) {
            if(i > 0) writer.print(" ");
            writer.print(A[i]);
        }
        writer.print("\n");
    }
}
