#include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
int read() {
	char c;
	int x=0,f=1;
	while(!isdigit(c=getchar()))
		f-=2*(c=='-');
	while (isdigit(c)){
		x=x*10+(c-48)*f;
		c=getchar();
	}
	return x;
}
char c[17];
int res,v[17],f[17];
void dfs(int p){
	if(p==4){
		for(int i=0;i<10;++i){
			if(f[i]==1&&!v[i])
				return;
		}
		++res;
		return;
	}
	for(int i=0;i<10;++i){
		if(!~f[i])
			continue;
		++v[i];
		dfs(p+1);
		--v[i];
	}
}
int main() {
	#ifndef ONLINE_JUDGE
	freopen("C.in","r",stdin);
	freopen("C.out","w",stdout);
	#endif
	clock_t t1=clock();
	//--------
	scanf("%s",c);
	for(int i=0;i<10;++i){
		switch(c[i]){
			case 'o':
				f[i]=1;
				break;
			case 'x':
				f[i]=-1;
				break;
		}
	}
	dfs(0);
	printf("%d",res);
	//--------
	clock_t t2=clock();
	fprintf(stderr,"time:%0.3lfs",1.0*(t2-t1)/CLOCKS_PER_SEC);
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
// auto mod int
const int mod = 998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
mint f(mint n){
   return n*(n+1)/mint(2);
}
int main() {
   ll a,b,c;cin>>a>>b>>c;
   mint ans=f(a)*f(b)*f(c);
   cout<<ans<<endl;

}