#include <iostream>
#include <fstream>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <utility>
#include <stack>
#include <iomanip>
#include <atcoder/all>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace atcoder;
using namespace boost::multiprecision;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using mint = modint998244353;
#define int long long
#define rep(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll INF = 1e18;
const int dx[8] = {0, 1, 0, -1, -1, -1, 1, 1};
const int dy[8] = {1, 0, -1, 0, -1, 1, -1, 1};
template <typename T>
inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template <typename T>
inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
void yn(bool t) { cout << (t ? "Yes" : "No") << endl; }
uint64_t seed = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937_64 rng(seed);
int randint(int l, int r)
{
  return uniform_int_distribution<int>(l, r)(rng);
}

int solve()
{
  string s;
  cin >> s;
  bool t = true;
  if (s.size() > 32 || s[0] == '_' || s[0] == '-' || s.back() == '_' || s.back() == '-')
  {
    t = false;
  }
  for (auto c : s)
  {
    if (!('A' <= c && c <= 'Z') && !('a' <= c && c <= 'z') && !(c == '-' || c == '_') && !('0' <= c && c <= '9'))
    {
      t = false;
    }
  }
  if (t)
  {
    cout << 200 << endl;
    ;
  }
  else
  {
    cout << 400 << endl;
  }
  return 0;
}

signed main()
{
#ifdef INPUT_FILE_PATH
  freopen(INPUT_FILE_PATH, "r", stdin);
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}