#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll INF = 1e18;
const ll MOD = 998244353;
const ll MODD = 1e9 + 7;
long long modpow(long long x, long long n);
long long modinv(long long a, long long m);
bool palindrome(const string& s);

int main(){
    string s;
    cin >> s;
    if(s.size() > 33 || s.size() == 0){
        cout << "400" << endl;
        return 0;
    }
    for(int i = 0;i<s.size();i++){
        if(!((int)s.at(i) == 45 || (int)s.at(i) == 95 || (48 <= (int)s.at(i) && (int)s.at(i)<= 57) || (65 <= (int)s.at(i) && (int)s.at(i)<= 90) || (97 <= (int)s.at(i) && (int)s.at(i)<= 122))){
            cout << "400" << endl;
            return 0;
        }
    }
    if((int)s.at(0) == 45 || (int)s.at(0) == 95){
            cout << "400" << endl;
            return 0;
    }
    if((int)s.at(s.size()-1) == 45 || (int)s.at(s.size()-1) == 95){
            cout << "400" << endl;
            return 0;
    }

    cout << "200" << endl;
    return 0;
}

long long modpow(long long x, long long n) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = ret * x % MOD;
        x = x * x % MOD;
        n >>= 1;
    }
    return ret;
}

long long modinv(long long a, long long m){
	long long b = m, u = 1, v = 0;
	while (b) {
		long long t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}

bool palindrome(const string& s){
    return equal(s.begin(), s.end(), s.rbegin());
}