For this Question: All the strings in TonoLand contain only characters 'a' and 'b'. Moreover they always have length N. 
You need to find the minimum length of a string such that all the strings of TonoLand are its subsequences.  

Example: If n=2, strings of TonoLand are "aa", "ab", "ba", "bb".The first and the only line of input contains a number N.

Constraints
1 <= N <= 1000000Output a single integer, the output to this problem.Sample Input 1
1

Sample Output 1
2

Explanation: If N=1, then the possible strings of TonoLand are "a", and "b". The minimum length string such that both the strings are its subsequences is "ab". 

Sample Input 1
2

Sample Output 2
4, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) {

     Scanner s= new Scanner (System.in);
	 int N = s.nextInt();
	 System.out.print (countsubstring(N));

	}
	public static int countsubstring(int n){
		return n*2;
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?