#include<bits/stdc++.h>



using namespace std;

const int N = 10010;

int n;
int arr[N];
int res = 0;
int nums[10010] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};


int col(int x) {
	if(nums[x] > 0) return nums[i];
	else {
		int sumFire = 0;
		while(x) {
			sumFire += num[x % 10];
			x /= 10;
		}
		return sumFire;
	}
}

void dfs(int x, int sum) {
	if(sum > n) return ;
	
	if(x > 3) {
		if(arr[1] + arr[2] == arr[3] && sum == n) {
			res ++;
		}
		return ;
	}
	
	for(int i = 0; i <= 10000; i ++) {
		arr[x] = i;
		dfs(x + 1, sum + col(i));
		arr[x] = 0;
	}
}

int main(){
	scanf("%d", &n);
	n -= 4;
	dfs(1, 0);
	printf("%d\n", res)
	return 0;
}