#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
void init() {}
void solve(int case_no) {
  string str;
  cin >> str;
  bool ck[3] = {false};
  if (str.length() < 5) {
    cout << "Too weak\n";
    return;
  }
  for (int i = 0; i < str.length(); i++) {
    if (islower(str[i])) ck[0] = true;
    if (isupper(str[i])) ck[1] = true;
    if (isdigit(str[i])) ck[2] = true;
  }
  cout << (ck[0] & ck[1] & ck[2] ? "Correct\n" : "Too weak\n");
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
}
