#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
using Graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;

int main() {
    string S;
    cin >> S;

    if(!(1 <= S.length() and S.length() <= 32)) {
        cout << 400 << endl;
        return 0;
    }
    for(ll i = 0; i < S.length(); ++i) {
        if (('a' <= S[i] && S[i] <= 'z') or ('A' <= S[i] && S[i] <= 'Z') or 
            ('0' <= S[i] && S[i] <= '9') or (S[i] == '-') or (S[i] == '_')) {
                continue;
        }
        cout << 400 << endl;
        return 0;
    }
    if(S[0] == '-' or S[0] == '_' or S[S.length()-1] == '-' or S[S.length()-1] == '_') {
        cout << 400 << endl;
        return 0;
    }
    cout << 200 << endl;
    return 0;
}