#include<bits/stdc++.h>
#include<boost/multiprecision/cpp_int.hpp>
namespace multip = boost::multiprecision;
using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())
#define vc_unique(v) v.erase(unique(v.begin(), vend()), v.end());
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

using ll = long long;
using lll = multip::int128_t;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;


#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rrep(i, n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define cut3(a,b,c,d,...) d
#define rep(...) cut3(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)

template<typename T, typename S> bool chmin(T &a, const S b){if(a>b){a=b; return true;} return false;}
template<typename T, typename S> bool chmax(T &a, const S b){if(a<b){a=b; return true;} return false;}

template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}
template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}

void Yes(bool a){cout<<(a?"Yes":"No")<<"\n";}
void YES(bool a){cout<<(a?"YES":"NO")<<"\n";}

const ll INF = 2e18;
const ll MOD = 998244353;


void solve() {
    string All = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_-";
    string S; cin >> S;
    if(sz(S) < 1 || sz(S) > 32 || S[0] == '-' || S[0] == '_' || S[sz(S) - 1] == '-' || S[sz(S) - 1] == '_') {
        cout << 400 << endl;
        return;
    }
    rep(sz(S)) {
        bool ok = false;
        rep(j, sz(All)) {
            if(S[i] == All[j]) ok = true;
        }
        if(!ok) {
            cout << 400 << endl;
            return;
        }
    }

    cout << 200 << endl;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    

    int t = 1;
    // cin >> t;
    
    while(t--) {
        solve();
    }
    
    return 0;
}