#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5;

string s; int n,a[100],vis[100],ans;

inline void dfs(int x)
{
    if(x>n) {ans++; return;}
    if(!vis[a[x]]) vis[a[x]]=1,dfs(x+1),vis[a[x]]=0;
    if(x<n && a[x] && !vis[a[x]*10+a[x+1]])
        vis[a[x]*10+a[x+1]]=1,dfs(x+2),vis[a[x]*10+a[x+1]]=0;
}
inline void Solve()
{
    n=s.size(),s=' '+s,ans=0;
    For(i,1,n) a[i]=s[i]-'0';
    dfs(1),cout<<ans<<endl;
}

int main()
{
    // freopen("1.in","r",stdin);

    while(cin>>s) Solve();
    // cerr<<1.0*clock()/CLOCKS_PER_SEC<<endl;
    return 0;
}