We can make digits with matches as shown below:

Given N matches, find the number of different numbers representable using the matches. We shall only make numbers greater than or equal to 0, so no negative signs should be used. For instance, if you have 3 matches, then you can only make the numbers 1 or 7. If you have 4 matches, then you can make the numbers 1, 4, 7 or 11. Note that leading zeros are not allowed (e.g. 001, 042, etc. are illegal). Numbers such as 0, 20, 101 etc. are permitted, though.

Input

Input contains no more than 100 lines. Each line contains one integer N (1 ≤ N ≤ 2000).

Output

For each N, output the number of different (non-negative) numbers representable if you have N matches.

Sample Input

3
4

Sample Output

2
4

一直被初始化搞死, 複習下 DP

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

public class Main {
	public static void main(String[] args) {
		BigInteger[] dp = new BigInteger[2001];
		int[] m = {6,2,5,5,4,5,6,3,7,6};
		for(int i = 1; i <= 2000; i++) {
			dp[i] = BigInteger.valueOf(0);
		}
		for(int i = 1; i < 10; i++) {
			dp[m[i]] = dp[m[i]].add(BigInteger.valueOf(1));
		}
		for(int i = 1; i <= 2000; i++) {
			for(int j = 0; j < 10; j++) {
				if(i-m[j] >= 1)
					dp[i] = dp[i].add(dp[i-m[j]]);
			}
		}
		dp[6] = dp[6].add(BigInteger.valueOf(1));
		for(int i = 2; i <= 2000; i++) {
			dp[i] = dp[i].add(dp[i-1]);
		}
		Scanner cin = new Scanner(System.in);
		int n;
		while(cin.hasNextInt()) {
			n = cin.nextInt();
			System.out.println(dp[n].toString());
		}
	}
}