Matches UVA - 11375

import java.math.BigInteger;
import java.util.Scanner;



public class Main {
	public static void main(String []args) {
		final int max=2010;
		int []c= {6,2,5,5,4,5,6,3,7,6};
		BigInteger []dp=new BigInteger[max];
		BigInteger []sum=new BigInteger[max];
		
		for(int i=0;i<max;i++) {
			dp[i]=new BigInteger("0");
			sum[i]=new BigInteger("0");
		}
		
		dp[0]=new BigInteger("1");
		for(int i=0;i<max;i++) {
			for(int j=0;j<10;j++) {
				if(!(i==0&&j==0)&&i+c[j]<max)
					dp[i+c[j]]=dp[i+c[j]].add(dp[i]);
			}
		}
		for(int i=1;i<max;i++)sum[i]=sum[i-1].add(dp[i]);
		
		Scanner cin=new Scanner(System.in);
		while(cin.hasNext()) {
			int n=cin.nextInt();
			if(n<6)System.out.println(sum[n]);
			else System.out.println(sum[n].add(BigInteger.ONE));
		}
	}
}