#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define vll vector<ll>

ll check(string op, vll pr) {
    stack<ll> nums;

    for (ll i = op.size() - 1; i >= 0; --i) {
        if (op[i] == '?') {
            nums.push(pr[pr.size() - 1]);
            pr.pop_back();
        } else {
            ll val1 = nums.top();
            nums.pop();

            ll val2 = nums.top();
            nums.pop();

            if (op[i] == 'n') {
                nums.push(min(val1, val2));
            } else {
                nums.push(max(val1, val2));
            }
        }
    }

    return nums.top();
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string a; cin >> a;

    string aux = "";
    ll num = 0;

    for (ll i = 0; i < a.size(); ++i) {
        if (a[i] == 'x' || a[i] == 'n' || a[i] == '?') {
            aux.pb(a[i]);

            if (a[i] == '?') {
                ++num;
            }
        }
    }

    set<ll> answers;

    vll nums;

    for (ll i = 1; i <= num; ++i) {
        nums.pb(i);
    }

    do {
        answers.insert(check(aux, nums));
    } while (next_permutation(nums.begin(), nums.end()));

    cout << answers.size() << endl;

    return 0;
}