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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
		
			 
			public class Solution123 implements Runnable
			{
				static final int MAX = 1000000007;
				static class InputReader
				{
					private InputStream stream;
					private byte[] buf = new byte[1024];
					private int curChar;
					private int numChars;
					private SpaceCharFilter filter;
					private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
			
					public InputReader(InputStream stream)
					{
						this.stream = stream;
					}
					
					public int read()
					{
						if (numChars==-1) 
							throw new InputMismatchException();
						
						if (curChar >= numChars)
						{
							curChar = 0;
							try 
							{
								numChars = stream.read(buf);
							}
							catch (IOException e)
							{
								throw new InputMismatchException();
							}
							
							if(numChars <= 0)				
								return -1;
						}
						return buf[curChar++];
					}
				 
					public String nextLine()
					{
						String str = "";
			            try
			            {
			                str = br.readLine();
			            }
			            catch (IOException e)
			            {
			                e.printStackTrace();
			            }
			            return str;
					}
					public int nextInt()
					{
						int c = read();
						
						while(isSpaceChar(c)) 
							c = read();
						
						int sgn = 1;
						
						if (c == '-') 
						{
							sgn = -1;
							c = read();
						}
						
						int res = 0;
						do 
						{
							if(c<'0'||c>'9') 
								throw new InputMismatchException();
							res *= 10;
							res += c - '0';
							c = read();
						}
						while (!isSpaceChar(c)); 
						
						return res * sgn;
					}
					
					public long nextLong() 
					{
						int c = read();
						while (isSpaceChar(c))
							c = read();
						int sgn = 1;
						if (c == '-') 
						{
							sgn = -1;
							c = read();
						}
						long res = 0;
						
						do 
						{
							if (c < '0' || c > '9')
								throw new InputMismatchException();
							res *= 10;
							res += c - '0';
							c = read();
						}
						while (!isSpaceChar(c));
							return res * sgn;
					}
					
					public double nextDouble() 
					{
						int c = read();
						while (isSpaceChar(c))
							c = read();
						int sgn = 1;
						if (c == '-') 
						{
							sgn = -1;
							c = read();
						}
						double res = 0;
						while (!isSpaceChar(c) && c != '.') 
						{
							if (c == 'e' || c == 'E')
								return res * Math.pow(10, nextInt());
							if (c < '0' || c > '9')
								throw new InputMismatchException();
							res *= 10;
							res += c - '0';
							c = read();
						}
						if (c == '.') 
						{
							c = read();
							double m = 1;
							while (!isSpaceChar(c)) 
							{
								if (c == 'e' || c == 'E')
									return res * Math.pow(10, nextInt());
								if (c < '0' || c > '9')
									throw new InputMismatchException();
								m /= 10;
								res += (c - '0') * m;
								c = read();
							}
						}
						return res * sgn;
					}
					
					public String readString() 
					{
						int c = read();
						while (isSpaceChar(c))
							c = read();
						StringBuilder res = new StringBuilder();
						do 
						{
							res.appendCodePoint(c);
							c = read();
						} 
						while (!isSpaceChar(c));
						
						return res.toString();
					}
				 
					public boolean isSpaceChar(int c) 
					{
						if (filter != null)
							return filter.isSpaceChar(c);
						return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
					}
				 
					public String next() 
					{
						return readString();
					}
					
					public interface SpaceCharFilter 
					{
						public boolean isSpaceChar(int ch);
					}
				}
			 	
				public static void main(String args[]) throws Exception
				{
					new Thread(null, new Solution123(),"Solution123",1<<26).start();
				}	
				long[] prefix;
				public void run()
				{
					InputReader sc= new InputReader(System.in);
					PrintWriter w= new PrintWriter(System.out);
					int n = sc.nextInt();
					if(n == 1){
						w.println(1 + " " + "1");
						w.print(1);
					}else{
						w.print(2*n-2 + " ");
						w.print(2);
						w.println();
						w.println(1 + " " + 2);
					}
					w.close();
				}
				int binarySearch1(int x,int l,int r,long val){
					HashSet<Integer> hset = new HashSet();
					int ans = -1;
					int mid = (l+r)/2;
					int remem = -1;
					while(true){
						hset.add(mid);
						if(function(x,mid,val)){	
							l = mid + 1;
						}else{	
							r = mid - 1;
						}
						remem = mid;
						mid = (l + r)/2;
						if(hset.contains(mid)){
							boolean ans1 = function(x,mid,val);
							boolean ans2 = function(x,remem,val);
							if(ans1 && ans2){
								ans = Math.max(mid,remem);
							}else if(ans1){
								ans = mid;
							}else{
								ans = remem;
							}
							break;
						}
					}
					return ans;
				}
				boolean function(int l,int mid,long a){
					if(prefix[mid] - prefix[l] <= a){
						return true;
					}
					return false;
				}
				int binarySearch(long a,long[] arr){
					int l = 1;
					int r = arr.length-1;
					int mid = (l + r)/2;
					HashSet<Integer> hset = new HashSet();
					int rem = -1;
					int ans = -1;
					while(true){
						hset.add(mid);
						if(function(a,arr,mid)){
							l = mid + 1;
						}else{
							r = mid - 1;
						}
						rem = mid;
						mid = (l + r)/2;
						if(hset.contains(mid)){
							boolean ans1 = function(a,arr,mid);
							boolean ans2 = function(a,arr,rem);
							if(ans1 && ans2){
								ans = Math.max(mid,rem);
							}else if(ans1){
								ans = mid;
							}else if(ans2){
								ans = rem;
							}
							break;
						}
					}
					return ans;
				}
				static boolean function(long a,long[] arr,int mid){
					if(arr[mid] <= a){
						return true;
					}
					return false;
				}
				static class RMQ{
					long[] segTree;
					RMQ(int length){
						int newLength = powerOfTwo(length);
						segTree = new long[newLength*2-1];
					}
					public void createSegTree(long[] input){
						for(int i = 0;i < segTree.length;i++){
							segTree[i] = Long.MAX_VALUE;
						}
						constructSegTree(input,0,input.length-1,0);
					}
					public void constructSegTree(long[] input,int low,int high,int pos){
						if(high == low){
							segTree[pos] = input[low];
							return;
						}
						int mid = (high + low)/2;
						constructSegTree(input,low,mid, 2*pos + 1);
						constructSegTree(input,mid+1, high, 2*pos + 2);
						segTree[pos] = Math.min(segTree[2*pos + 1],segTree[2*pos + 2]);
					}
					public long rangeMinimumQuery(int qlow,int qhigh,int length){
						return rangeMinimumQuerySolve(0,length-1,qlow,qhigh,0);
					}
					public long rangeMinimumQuerySolve(int low,int high,int qlow,int qhigh,int pos){
						if(qlow <= low && qhigh >= high){
							return segTree[pos];
						}
						if(qlow > high || qhigh < low){
							return Long.MAX_VALUE;
						}
						int mid = (high + low)/2;
						return Math.min(rangeMinimumQuerySolve(low,mid,qlow,qhigh,2*pos+1), rangeMinimumQuerySolve(mid+1,high,qlow,qhigh,2*pos+2));
					}
					int powerOfTwo(int length){
						String binary = Integer.toBinaryString(length);
						return (int)(Math.pow(2,binary.length() - 1) == length ? length : Math.pow(2,binary.length()));
					}
					public void updateSegmentTree(int index, long delta, int low, int high, int pos){
					       
				        if(index < low || index > high){
				            return;
				        }
				        
				        if(low == high){
				            segTree[pos] += delta;
				            return;
				        }
				        int mid = (low + high)/2;
				        updateSegmentTree( index, delta, low, mid, 2 * pos + 1);
				        updateSegmentTree( index, delta, mid + 1, high, 2 * pos + 2);
				        segTree[pos] = Math.min(segTree[2*pos+1], segTree[2*pos + 2]);
				    }
					public void updateSegmentTree(long input[], int index, long delta){
					        input[index] += delta;
					        updateSegmentTree( index, delta, 0, input.length - 1, 0);
					}
					public void updateSegmentTreeRange(long input[], long segmentTree[], int startRange, int endRange, long delta) {
				        for(int i = startRange; i <= endRange; i++) {
				            input[i] += delta;
				        }
				        updateSegmentTreeRange(startRange, endRange, delta, 0, input.length - 1, 0);
				    }

					public void updateSegmentTreeRange(int startRange, int endRange, long delta, int low, int high, int pos) {
				        if(low > high || startRange > high || endRange < low ) {
				            return;
				        }

				        if(low == high) {
				            segTree[pos] += delta;
				            return;
				        }

				        int middle = (low + high)/2;
				        updateSegmentTreeRange( startRange, endRange, delta, low, middle, 2 * pos + 1);
				        updateSegmentTreeRange( startRange, endRange, delta, middle + 1, high, 2 * pos + 2);
				        segTree[pos] = Math.min(segTree[2*pos+1], segTree[2*pos+2]);
				    }
				}
				
				static class Pair{
					int x,y;
					Pair(int x,int y){
						this.x = x;
						this.y = y;
					}
					public boolean equals(Object o)
					{
						Pair p = (Pair)o;
						return p.x==x && p.y==y;
					
					}
					
					public int hashCode()
					{
						return new Long(x).hashCode()*31 + new Long(y).hashCode();
					}
				}
			}