d={0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}
s=input().rstrip()
print(d[int(s[0])]*d[int(s[1])])#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,n1,n2,s1,s2;
cin>>n;
n1=n%10;
n2=n/10;
if (n1==0 || n1== 2 || n1==6 || n1==9){s1=2;}
else if(n1==1 ){s1=7;}
else if(n1==3 || n1==4){s1=3;}
else if(n1==5){s1=4;}
else if(n1==7){s1=5;}
else if(n1==8){s1=1;}
if (n2==0 || n2== 2 || n2==6 || n2==9){s2=2;}
else if(n2==1 ){s2=7;}
else if(n2==3 || n2==4){s2=3;}
else if(n2==5){s2=4;}
else if(n2==7){s2=5;}
else if(n2==8){s2=1;}
cout<< s1*s2 <<endl;
return 0;
}
1566A - Median Maximization | 1278A - Shuffle Hashing |
1666F - Fancy Stack | 1354A - Alarm Clock |
1543B - Customising the Track | 1337A - Ichihime and Triangle |
1366A - Shovels and Swords | 919A - Supermarket |
630C - Lucky Numbers | 1208B - Uniqueness |
1384A - Common Prefixes | 371A - K-Periodic Array |
1542A - Odd Set | 1567B - MEXor Mixup |
669A - Little Artem and Presents | 691B - s-palindrome |
851A - Arpa and a research in Mexican wave | 811A - Vladik and Courtesy |
1006B - Polycarp's Practice | 1422A - Fence |
21D - Traveling Graph | 1559B - Mocha and Red and Blue |
1579C - Ticks | 268B - Buttons |
898A - Rounding | 1372B - Omkar and Last Class of Math |
1025D - Recovering BST | 439A - Devu the Singer and Churu the Joker |
1323A - Even Subset Sum Problem | 1095A - Repeating Cipher |