#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi first
#define se second
using lint = long long;
using P = pair<int,int>;
template<class T> using V = vector<T>;
template<class T> using priq     = priority_queue<T>;
template<class T> using priq_inv = priority_queue<T, vector<T>, greater<T>>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
template<class T> T ceil(const T &a, const T &b) { return (a+b-1)/b; }
template<class T> bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
struct INF { template<class T> operator T() { return numeric_limits<T>::max() / 2; } } INF;

template<class T, class U> istream& operator>>(istream &in, pair<T,U> &p) {
    return in >> p.first >> p.second;
}
template<class T, class U> ostream& operator<<(ostream &out, const pair<T,U> &p) {
    return out << p.first << ' ' << p.second;
}
template<class T> istream& operator>>(istream &in, vector<T> &v) {
    for(auto &&e: v) in >> e;
    return in;
}
template<class T> ostream& operator<<(ostream &out, const vector<T> &v) {
    for(const auto &e: v) out << e << ' ';
    return out;
}

/*----------------------------------------------------------------------------------------------------*/


int main() {
    int n;
    cin >> n;
    n *= 108;
    n /= 100;
    if(n < 206) puts("Yay!");
    if(n == 206) puts("so-so");
    if(n > 206) puts(":(");
}
#include <bits/stdc++.h>
using namespace std;

int main() {
  string S;
  cin >>S;
  
  int ans=0;
  for(int i=0;i<10000;i++) { 
    vector<bool> used(10);
    int x=i;
    for(int j=0;j<4;j++) {
      used[x%10] = true;
      x /=10;
    }
    bool able = true;
    for(int j=0;j<10;j++) {
      if(S[j] == 'o' && !used[j]) {
        able=false;
      }
      if(S[j] == 'x' && used[j]) {
        able=false;
      }
    }
    ans += able;
  }
  cout<<ans<<endl;
    

}