#include<bits/stdc++.h>
#include<atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
long long modpow(long long a, long long n, long long mod) {
    a%=mod;
    assert(a!=0||n!=0);
    if(a==0)return 0;
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
using mint9=atcoder::modint998244353;

constexpr pii dx4[4] = {pii{-1, 0}, pii{0, -1},pii{1, 0}, pii{0, 1} };
string udlr="ULDR";
void solve(){
   
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    string s;cin>>s;
    if(s.size()>32){
        cout<<"400"<<endl;
        return 0;
    }

    rep(i,0,s.size()){
        if('A'<=s[i]&&s[i]<='Z')continue;
        if('a'<=s[i]&&s[i]<='z')continue;
        if('0'<=s[i]&&s[i]<='9')continue;
        if(s[i]=='_'||s[i]=='-'){
            if(i==0||i==s.size()-1){
                cout<<"400"<<endl;
                return 0;
            }
            continue;
        }
        cout<<"400"<<endl;
        return 0;
    }
    cout<<"200"<<endl;
    return 0;
}
/*

*/