#include <bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
// #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = i64(1e18)+MOD;

template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

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

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

#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;

#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);

void _dump(int, string& x){
    clog << x << endl;
}

template <typename T>
void _dump(bool, T& x){
    clog << x << " ";
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){

    for(auto& elm : x)
        _dump(0, elm);

    clog << endl;
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


bool solve(){

    int m;
    input(m);
    vector<string> c(m);
    vector<int> l(m), r(m);
    unordered_map<string, pair<int,int>> ma;
    pararell_input(m, c, l, r);
    for(auto& x : r)
        ++x;
    for(int i = 0; i < m; ++i)
        ma[c[i]] = make_pair(l[i], r[i]);
    int n;
    input(n);
    vector<string> v(n);
    input(v);
    vector<string> op{"+", "-", "*", "/"};

    using bs = bitset<256>;
    stack<bs> st;

    for(int i = 0; i < n; ++i){
        if(ma.find(v[i]) != ma.end()){
            bs s;
            auto p = ma[v[i]];
            for(int j = p.first; j < p.second; ++j)
                s.set(j);
            st.push(s);
        }else if(find(op.begin(), op.end(), v[i]) != op.end()){

            if(st.size() < 2){
                cout << "error" << endl;
                return 0;
            }
            bs b = st.top();
            st.pop();
            bs a = st.top();
            st.pop();

            bs ans;

            for(int j = 0; j < 256; ++j)
                for(int k = 0; k < 256; ++k){
                    if(!a[j] || !b[k])
                        continue;
                    if(v[i] == "+"){
                        int val = (j + k) % 256;
                        ans.set(val);
                    }
                    if(v[i] == "-"){
                        int val = (j - k + 256) % 256;
                        ans.set(val);
                    }
                    if(v[i] == "*"){
                        int val = (j * k) % 256;
                        ans.set(val);
                    }
                    if(v[i] == "/"){
                        if(k == 0){
                            cout << "error" << endl;
                            return 0;
                        }
                        int val = j / k;
                        ans.set(val);
                    }
                }

            st.push(ans);

        }else{
            int val = stoi(v[i]);
            bs s;
            s.set(val);
            st.push(s);
        }
    }

    if(st.size() == 1)
        cout << "correct" << endl;
    else
        cout << "error" << endl;

    return false;
}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    while(solve());

}



Measured memory_bytes: 3216