#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int n; //100
int way[10];
bool vis[10];
int cnt = 0;

int clac(int l, int r){
    int res = 0;
    for (int i = l; i <= r; i ++){
        res = res * 10 + way[i];
    }
    return res;
}
void dfs(int u){
    if(u == 10){
        for (int i = 1; i <= 7; i ++){
            for (int j = i + 1; j <= 8; j ++){
                int a = clac(1, i);
                int b = clac(i + 1, j);
                int c = clac(j + 1, 9);
                if (a * c + b == n * c) cnt ++;
            }
        }
        return ;
    }
    for (int i = 1; i <= 9; i ++){
        if (!vis[i]){
            way[u] = i;
            vis[i] = true;
            dfs(u + 1);
            vis[i] = false;
        }
    }
}
int main(){
    cin >> n;
    dfs(1);
    cout << cnt;
    return 0;
}