#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()

int pw(int n,int k){
  assert(k>=0);
  int res=1;
  while(k){
    if(k&1)res*=n;
    n*=n;
    k>>=1;
  }
  return res;
}

signed main(){
  string s;cin>>s;
  int ans=0;
  REP(i,10000){
    bool ok=1;
    set<int> se;
    REP(j,4)se.insert((i/pw(10,j))%10);
    REP(j,10){
      if(s[j]=='o'&&!se.count(j))ok=0;
      if(s[j]=='x'&&se.count(j))ok=0;
    }
    ans+=ok;
  }
  cout<<ans<<endl;
}


#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = ((n) - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

// inputs
#define VLLIN(x, n) vll x(n); REP(i, n) cin >> x[i];
#define VIIN(x, n) vin x(n); REP(i, n) cin >> x[i];
#define VLDIN(x, n) vld x(n); REP(i, n) cin >> x[i];
#define SIN(s, n) string s; cin >> s;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

template <typename T>
void print(vector<T>& x) {
    int N = x.size();
    REP(i, N) {
        if (i > 0) cout << " ";
        cout << x[i];
    }
    cout << "\n";
}

ll fact(ll n) {
    ll ans = 1;
    REP(i, n) ans *= i + 1;
    return ans;
}

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

    string s;
    cin >> s;

    ll ans = 0;
    REP(x, 10000) {
        int cur = x;
        set<int> ss;
        while(cur > 0) {
            ss.insert(cur % 10);
            cur /= 10;
        }

        if (x < 1000) ss.insert(0);

        bool f = true;
        REP(j, s.size()) {
            if (s[j] == 'x') {
                if (ss.count(j) > 0) {
                    f = false;
                    break;
                }
            } else if (s[j] == 'o') {
                if (ss.count(j) == 0) {
                    f = false;
                    break;
                }
            }
        }

        if (f) ans++;
    }

    print(ans);
}
