#include<bits/stdc++.h> using namespace std; const int single[10]={6,2,5,5,4,5,6,3,7,6}; int change[2223]={6,2,5,5,4,5,6,3,7,6}; int n,ans; int key,c; int equal(int num) { int m,t=0; while(num>0) { m=num%10; num=num/10; t+=single[m]; } return t; } int main() { for(int i=10;i<2223;i++) { change[i]=equal(i); } scanf("%d",&n); for(int i=0;i<1111;i++) { for(int j=0;j<1111;j++) { key=change[i+j]; c=n-4-(change[i]+change[j]); if(key==c) ans++; } } printf("%d",ans); return 0; }