hdu1502

import java.math.BigInteger;
import java.util.Scanner;
public class Main {
	static int n;
	static BigInteger dp[][][]=new BigInteger [66][66][66];
    	public static void init(){
    		for(int j=0;j<=n+1;j++){
    			for(int k=0;k<=n+1;k++){
    				for(int l=0;l<=n+1;l++) dp[j][k][l]=BigInteger.valueOf(0);
    			}
    		}
    	dp[0][0][0]=BigInteger.valueOf(1);
    }
	public static void main(String[] args) {
		Scanner cin= new Scanner(System.in);
		while(cin.hasNext()){
			n=cin.nextInt();
			init();
				for(int j=0;j<=n;j++){
					for(int k=0;k<=j;k++){
						for(int l=0;l<=k;l++){
							if(dp[j][k][l].equals(BigInteger.valueOf(0))) continue;
							dp[j+1][k][l]=dp[j+1][k][l].add(dp[j][k][l]);
							if(k+1<=j){
								dp[j][k+1][l]=dp[j][k+1][l].add(dp[j][k][l]);
							}
							if(l+1<=k){
								dp[j][k][l+1]=dp[j][k][l+1].add(dp[j][k][l]);
							}
						}
					}
				}
			System.out.println(dp[n][n][n]);
			System.out.println();
		}
	}
}