#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound


#include <bitset>  // bitset
#include <cctype>  // isupper, islower, isdigit, toupper, tolower
#include <cmath>   // cmathライブラリをインクルード
#include <cstdint> // int64_t, int*_t
#include <cstdio>  // printf
#include <deque>   // deque
#include <iomanip>
#include <iostream>      // cout, endl, cin
#include <map>           // map
#include <queue>         // queue, priority_queue
#include <set>           // set
#include <stack>         // stack
#include <string>        // string, to_string, stoi
#include <tuple>         // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility>       // pair, make_pair
#include <vector>        // vector
using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define Yout cout << "Yes" << '\n'
#define Nout cout << "No" << '\n'
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
// #define _LIBCPP_DEBUG 0と書く必要があります。
const ll mod = 998244353;
const ll mod2 = (long long)1000000007;
const ll INF = (long long)2e18;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
//  const vector<int> dx = {1, 1, 1, 0, -1, -1, -1, 0};
//  const vector<int> dy = {1, 0, -1, -1, -1, 0, 1, 1};
// const vector<int> dx = {1, -1, 1, -1};
// const vector<int> dy = {1, 1, -1, -1};

template <class T> void li(T a) {
  for (auto i : a) {
    cout << i << ' ';
  }
  cout << endl;
}

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

bool ch(ll l, ll r, ll x) { return l <= x and x < r; }

bool chch(ll h, ll w, ll x, ll y) { return ch(0, h, x) and ch(0, w, y); }




void solve(){
	string s;cin >> s;
	ll n=s.size();
	if(!(1<=n and n<=32)){
		cout << 400 << endl;
		return ;
	}
	else if(s.back()=='_' or s.back()=='-'){
		cout << 400 << endl;
		return;
	}
	
	set<char> st;rep(i,26){
		st.insert('a'+i);
		st.insert('A'+i);
	}
	rep(i,10){
		st.insert('0'+i);
	}
	st.insert('_');
	st.insert('-');
	rep(i,n){
		if(!st.count(s[i])){
			cout << 400 << endl;
			return ;
		}
	}
	cout << 200 << endl;
}

int main(){
	solve();
}