UVA11375

import java.util.List ; 
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner  ;
import java.util.Vector;
import java.math.BigInteger;
import java.sql.* ; 
 
public class Main {
	   
	   public static  int  maxn = 2008 ; 
	   
	   public static void main(String[] args){
	        
		      int [] c = new int[]{6,2,5,5,4,5,6,3,7,6} ; 
		      BigInteger[] dp = new BigInteger[maxn] ;
		      BigInteger[] sum = new BigInteger[maxn] ;
		      Arrays.fill(dp, BigInteger.ZERO) ;
	          
		      dp[0] = BigInteger.ONE ;
		      for(int i = 0 ; i < maxn ; i++){
		    	   for(int j = 0 ; j <= 9 ; j++){
		    		     if(i == 0 && j == 0)  continue ;
		    		     if(i+c[j] < maxn){
		    		    	  dp[i+c[j]] = dp[i+c[j]].add(dp[i]) ;
		    		     }
		    	   }
		      }
		      
		      sum[0] = BigInteger.ZERO ;
		      for(int i = 1 ; i < maxn ; 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].add(BigInteger.ONE)) ;
		    	    else       System.out.println(sum[n]) ;
		      }
		      
	   }
}