s = input()
print("Correct" if len(s) >= 5 and any(list(map(lambda x: x in '0123456789',list(s)))) and any(list(map(lambda x: x.isupper(),list(s)))) and any(list(map(lambda x: x.islower(),list(s)))) else "Too weak")
//ifstream fin("INPUT.TXT");
//ofstream fout("OUTPUT.TXT");
//fin.close();
//fout.close();
//cout << fixed << setprecision(6);
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ICC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define str string
#define pb push_back
#define ull unsigned long long
using namespace std;
void NOK(){
ull n, m;
cin >> n >> m;
cout << (n * m) / __gcd(n, m);
}
void b(){
str s;
cin >> s;
if(s.size() < 5){
cout << "Too weak\n";
return;
}
bool ok = false, ok1 = false, ok2 = false;
for(int i = 0; i < s.size(); i ++){
if(s[i]>='A' and s[i]<='Z'){
ok = true;
}
else if(s[i]>='a' and s[i]<='z'){
ok1 = true;
}
else if(s[i]>='0' and s[i]<='9'){
ok2 = true;
}
}
if(ok == true and ok1 == true and ok2 == true){
cout << "Correct\n";
}
else{
cout << "Too weak\n";
}
}
int main(){
ICC
ld t = 1;
///cin >> t;
while(t --){
b();
}
}
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |