Problem: 

Input

The input contains a single integer a (0 ≤ a ≤ 35).

Output

Output a single integer.

Examples

Input

3


Output

8


Input

10


Output

1024

Solution (in JAVA):

Solution:
import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;

 
public class Check
{
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
		
		short nextShort()
        {
            return Short.parseShort(next()); 
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
	
   public static void main (String[] args)
   {
		FastReader sc = new FastReader();
		
		int n=sc.nextInt();
		
		long total[]={1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656L, 530317312L, 1060634624L, 2121269248L, 4242538496L, 8485076992L, 16970153984L, 33940307968L };
		
		//while(n-- > 0)
			//total*=2;
		
		System.out.println(total[n]);
   }
}
   
   /*static long mod(long x,long n,long m)
   {
    if (n == 0)
        return 1;
    else if (n%2==0)
        return mod(((x%m)*(x%m))%m,n/2,m);
    else if(n%2==1)
        return (((x%m)*mod(((x%m)*(x%m))%m,(n-1)/2,m))%m);
	else
		return 0;
   }*/



/* class a implements Comparable<a>
	{  
		int val;  
		int ind;  
		a(int val,int ind)
		{  
			this.val=val;  
			this.ind=ind;  
		}  
		  
		public int compareTo(a a1)
		{  
			if(val==a1.val)  
			{
				//if(name.length()==a1.name.length())
					if(ind<a1.ind)
						return -1;
					else
						return 1;
				//else
					//return name.length()<a1.name.length()?-1:1;
			}
			else if(val<a1.val)  
			return -1;  
			else  
			return 1;  
		}  	
	
	}  */