#include #define fi first #define se second #define rep(i,s,n) for (int i = (s); i < (n); ++i) #define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define len(x) (int)(x).size() #define dup(x,y) (((x)+(y)-1)/(y)) #define pb push_back #define eb emplace_back #define Field(T) vector> #define pq(T) priority_queue,greater> using namespace std; using ll = long long; using P = pair; int main() { int a, b, c; cin >> a >> b >> c; if (a + b == c) cout << "Correct" << endl; else cout << "Incorrect" << endl; return 0; }