#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n == 1) return false;
  if (n == 2) return true;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  string s;
  cin >> s;
  long long f1 = 0, f2 = 0, f3 = 0;
  if (s.length() >= 5) {
    for (long long i = 0; i < s.length(); i++) {
      if (isupper(s[i]))
        f1++;
      else if (islower(s[i]))
        f2++;
      else if (isdigit(s[i]))
        f3++;
    }
    if (f1 >= 1 && f2 >= 1 && f3 >= 1)
      cout << "Correct";
    else
      cout << "Too weak";
  } else
    cout << "Too weak";
  return 0;
}
