#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
int vis[200];
const int Maxn=1e2+10;
char c[Maxn];
int ans;
int n;
inline void dfs(int x){
    // cout<<x<<endl;
    if(x==n+1){
        ++ans;return;
    }
    if(c[x]=='0'){
        if(vis[0]) return;
        vis[0]=1;
        dfs(x+1);
        vis[0]=0;
        return;
    }
    int id=c[x]-'0';
    // cout<<"*"<<id<<endl;
    if(!vis[id]){
        vis[id]=1;
        dfs(x+1);
        vis[id]=0;
    }
    if(x==n) return;
    id=(c[x]-'0')*10+(c[x+1]-'0');
    // cout<<"**"<<id<<endl;
    if(!vis[id]){
        vis[id]=1;
        dfs(x+2);
        vis[id]=0;
    }
}
inline void work(){
    ans=0;n=strlen(c+1);
    fr(i,0,99) vis[i]=0;
    dfs(1);
    writeln(ans);
}
inline void init(){
    while(scanf("%s",c+1)!=EOF) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}