#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int arr[25]={0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,8,9,6,9,29,39,38,65,88,128};
/*
int arr[10]={6,2,5,5,4,5,6,3,7,6},ans;
set< pair< string,pair<string,string> > > ss;
bool check(vector<int> a[3]){
    string s[3];
    for (int i=0;i<3;++i){
        for (auto &&j : a[i]){
            s[i]+=(char)(j^48);
        }
    }
    if ((stoll(s[0])+stoll(s[1]))!=stoll(s[2])){return 0;}
    if (ss.count({s[0],{s[1],s[2]}})){return 0;}
    ss.insert({s[0],{s[1],s[2]}});
    return 1;
}
void dfs(int x,vector<int> a[3]){
    if (!x){
        if (a[0].empty()||a[1].empty()||a[2].empty()){return;}
        if (check(a)){++ans;}return;
    }
    for (int i=0;i<=9;++i){
        for (int j=0;j<3;++j){
            if (((a[j].empty())||(a[j][0]))&&(x>=arr[i])){
                a[j].emplace_back(i);
                dfs(x-arr[i],a);
                a[j].pop_back();
            }
        }
    }
    return;
}
vector<int> a[3];
*/
int main(){
    int n;
    scanf("%d",&n);
    /*
    dfs(max(n-4,0),a);
    printf("%d",ans);
    */
    printf("%d",arr[n]);
    return 0;
}