#line 1 "/home/kappa/Kyopro/kinugoshi_Library/kinugoshi/overwrite/overwrite_io.hpp"
#include <atcoder/modint>
#include <iostream>
#include <utility>
#include <vector>
namespace std {
template <int m, std::enable_if_t<(1 <= m)> * = nullptr>
ostream &operator<<(ostream &os, const atcoder::static_modint<m> &v) {
    os << v.val();
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
    os << v.first << " " << v.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &v) {
    is >> v.first >> v.second;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
    for(int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i != (int)v.size() - 1 ? " " : "");
    }
    return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
    for(T &in : v)
        is >> in;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
    for(int i = 0; i < (int)v.size(); i++) {
        for(int j = 0; j < (int)v[i].size(); j++) {
            os << v[i][j] << (j != (int)v[i].size() - 1 ? " " : "\n");
        }
    }
    return os;
}
} // namespace std
#line 2 "/home/kappa/Kyopro/kinugoshi_Library/kinugoshi/overwrite/template.hpp"
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(a, b) for(long long a = 0; a < (long long)(b); a++)
#define repi(a, b) for(int a = 0; a < (int)(b); a++)
#define repr(a, b) for(long long a = (long long)(b)-1; a >= 0; a--)
#define repo(a, b) for(int a = (int)(b)-1; a >= 0; a--)
template <typename T> inline void chmin(T &a, T b) { a = min(a, b); }
template <typename T> inline void chmax(T &a, T b) { a = max(a, b); }
inline void YesNo(bool ret) {
    if(ret)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
#line 2 "main.cpp"
using mint = modint998244353;
// using namespace kinugoshi;
// using namespace boost::multiprecision;
int op(int a, int b) { return min(a, b); }
int e() { return 2147483647; }

int main() {
    string S;
    cin >> S;
    if(1 > ssize(S) || ssize(S) > 32) {
        cout << 400 << endl;
        return 0;
    }
    set tmp = {'_', '-'};
    if(tmp.contains(S[0]) || tmp.contains(S[ssize(S) - 1])) {
        cout << 400 << endl;
        return 0;
    }
    for(auto a : S) {
        if(!(('a' <= a && a <= 'z') || ('A' <= a && a <= 'Z') ||
             ('0' <= a && a <= '9') || tmp.contains(a))) {
            cout << 400 << endl;
            return 0;
        }
    }
    cout << 200 << endl;
}