#include <iostream>
using namespace std;
const int N = 10010;
int n;
int num[N] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int ways[N];
int res;
void dfs(int u, int sum)
{
if (sum > n) return;
if (u >= 3)
{
if ((ways[0] + ways[1]) == ways[2] && (sum == n))
res ++ ;
return;
}
for (int i = 0; i < 1010; i ++ )
{
ways[u] = i;
dfs(u + 1, sum + num[i]);
ways[u] = 0;
}
}
int main()
{
scanf("%d", &n);
n -= 4;
for (int i = 10; i < 1010; i ++ )//预处理
num[i] = num[i % 10] + num[i / 10];
dfs(0, 0);
cout << res << endl;
return 0;
}