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

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(a); i > (int)(b); i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define PQ priority_queue<int, vector<int>, greater<int>>
#define PQ_g priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
const int d4[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
const int d8[8][2] = {{0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}};
void Yes(bool b) {cout << (b ? "Yes" : "No") << endl;}

int main() {
    string s; cin >> s;
    if (s.size() < 1 || 32 < s.size()) {
        cout << 400 << endl;
        return 0;
    }

    if (s[0] == '_' || s[0] == '-' || s[s.size() - 1] == '_' || s[s.size() - 1] == '.') {
        cout << 400 << endl;
        return 0;
    }

    set<char> available;
    for (char c = 'a'; c <= 'z'; c++) available.insert(c);
    for (char c = 'A'; c <= 'Z'; c++) available.insert(c);
    for (char c = '0'; c <= '9'; c++) available.insert(c);
    available.insert('_');
    available.insert('-');

    bool flg = true;
    for (auto &c: s) {
        if (!available.count(c)) {
            flg = false;
            break;
        }
    }

    cout << (flg ? 200 : 400) << endl;
}