#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;

template<typename T>
struct edge {
    int src, to;
    T cost;
};

template<typename T>
using Graph = vector<vector<edge<T>>>;

using State = string::const_iterator;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    // ifstream in("in.txt");
    // cin.rdbuf(in.rdbuf());

    int m; cin >> m;
    using Data = bitset<256>;
    map<string,Data> mp;
    REP(i, m) {
        string name; int lb, ub;
        cin >> name >> lb >> ub;
        FOR(k, lb, ub+1) {
            mp[name].set(k);
        }
    }
    int n; cin >> n;
    vector<string> e(n);
    REP(i, n) cin >> e[i];

    stack<Data> stk;

    auto check = [&]() {
        REP(i, n) {
            if ('0' <= e[i][0] and e[i][0] <= '9') {
                Data num;
                num.set(stoi(e[i]));
                stk.push(num);
            } else if (e[i] == "+") {
                Data r = stk.top();
                stk.pop();
                Data l = stk.top();
                stk.pop();
                Data num;
                REP(a, 256) {
                    REP(b, 256) {
                        if (l[a] and r[b]) {
                            num.set((a + b) % 256);
                        }
                    }
                }
                stk.push(num);
            } else if (e[i] == "-") {
                Data r = stk.top();
                stk.pop();
                Data l = stk.top();
                stk.pop();
                Data num;
                REP(a, 256) {
                    REP(b, 256) {
                        if (l[a] and r[b]) {
                            num.set((a - b + 256) % 256);
                        }
                    }
                }
                stk.push(num);
            } else if (e[i] == "*") {
                Data r = stk.top();
                stk.pop();
                Data l = stk.top();
                stk.pop();
                Data num;
                REP(a, 256) {
                    REP(b, 256) {
                        if (l[a] and r[b]) {
                            num.set((a * b) % 256);
                        }
                    }
                }
                stk.push(num);
            } else if (e[i] == "/") {
                Data r = stk.top();
                stk.pop();
                Data l = stk.top();
                stk.pop();
                Data num;
                REP(a, 256) {
                    REP(b, 256) {
                        if (l[a] and r[b]) {
                            if (b == 0) {
                                return false;
                            }
                            num.set((a / b) % 256);
                        }
                    }
                }
                stk.push(num);
            }
            else {
                stk.push(mp[e[i]]);
            }
        }
        return true;
    };

    bool ans = check();
    cout << (ans ? "correct" : "error") << endl;

    return 0;
}




Measured memory_bytes: 3248