#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int n;
string s;
ll x;
ll allSum=0;
ll allProd=1;

ll GetSum(){
	vvll dp;
	initvv(dp,n+1,allSum+1,0LL);
	dp[0][0]=1;
	rep(i,n){
		rep(j,allSum+1){
			rep(k,10){
				if(j+k>allSum) continue;
				dp[i+1][j+k]+=dp[i][j];
			}
		}
	}
	ll ret=0;
	rep(i,allSum){
		ret+=dp[n][i];
	}
	return ret;
}
ll fact[200];
ll GetPattern(vint &v,bool f=false){
	ll sum=0;
	rep(i,v.size()) sum+=v[i];
	ll ret=fact[sum];
	rep(i,v.size()) ret/=fact[v[i]];
	// if(f) cout<<"Pattern "<<ret<<endl;
	return ret;
}

ll GetPattern2(vint &v,string &s){
	vint tmp=v;
	ll ret=0;
	rep(i,n){
		// cout<<i<<" "<<ret<<endl;
		int t=s[i]-'0';
		rep(j,10){
			if(tmp[j]==0) continue;
			if(j<t){
				tmp[j]--;
				// cout<<"j "<<j<<" "<<t<<endl;
				ret+=GetPattern(tmp,true);
				tmp[j]++;
			}
		}
		if(tmp[t]) tmp[t]--;
		else break;
	}
	// cout<<"ret "<<ret<<endl;
	return ret;
}

vint cnt(10);
ll dfs(int t,ll sum,ll num,string &s){
	if(t==0){
		ll ret=0;
		ll p=1;
		rep(i,10){
			rep(j,cnt[i]) p*=i+1;
		}
		if(p<allProd){
			ret+=GetPattern(cnt);
		}
		else if(p==allProd){
			ret+=GetPattern2(cnt,s);
		}
		return ret;
	}
	ll ret=0;
	reep(i,num,10){
		if(sum+i+9*(t-1)<allSum) continue;
		if(sum+i+num*(t-1)>allSum) continue;
		cnt[i]++;
		ret+=dfs(t-1,sum+i,i,s);
		cnt[i]--;
	}
	return ret;
}

ll GetProd(string &s){
	return dfs(n,0,0,s);
}

void mainmain(){
	fact[0]=1;
	reep(i,1,200){
		fact[i]=fact[i-1]*i;
	}
	string s;
	cin>>s;
	n=s.size();
	convert(s,x);
	rep(i,n) allSum+=s[i]-'0',allProd*=(s[i]+1-'0');
	ll a=GetSum();
	ll b=GetProd(s);
	cout<<a+b<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 3216