#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>

using namespace std;


#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#else
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif

#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

template <class T> void sort(vector<T>& c) { sort(c.begin(), c.end()); }
template <class T> void unique(vector<T>& c) { c.erase(unique(c.begin(), c.end()), c.end()); }
template <class T> void sort_unique(vector<T>& c) { sort(c); unique(c); }

typedef long long ll;
typedef pair<int, int> pint;

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

template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }

bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print(const T& c, const string& deli = " ", int br = 1) { foreach (it, c) { cout << *it; if (++it != c.end()) cout << deli;--it; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(T& a, U& b, int n) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);
const int mod = 1000000007;




int main()
{
    int m;
    cin >> m;
    map<string, vector<int> > var;
    for (int i = 0; i < m; ++i)
    {
        string s;
        int l, u;
        cin >> s >> l >> u;
        for (int j = l; j <= u; ++j)
            var[s].push_back(j);
    }

    int n;
    cin >> n;
    stack<vector<int> > s;
    for (int i = 0; i < n; ++i)
    {
        string in;
        cin >> in;

        if (var.count(in))
        {
            s.push(var[in]);
        }
        else if (isdigit(in[0]))
        {
            vector<int> t;
            t.push_back(to_T<int>(in));
            s.push(t);
        }
        else
        {
            vector<int> a, b;
            b = s.top(); s.pop();
            a = s.top(); s.pop();

            vector<int> c;
            for (int i = 0; i < a.size(); ++i)
            {
                for (int j = 0; j < b.size(); ++j)
                {
                    if (in[0] == '+')
                        c.push_back((a[i] + b[j]) % 256);
                    else if (in[0] == '-')
                        c.push_back((a[i] - b[j] + 256) % 256);
                    else if (in[0] == '*')
                        c.push_back((a[i] * b[j]) % 256);
                    else
                    {
                        if (b[j] == 0)
                        {
                            cout << "error" << endl;
                            return 0;
                        }

                        c.push_back((a[i] / b[j]) % 256);
                    }
                }
            }

            sort_unique(c);
            s.push(c);
        }
    }

    cout << "correct" << endl;
}

Measured memory_bytes: 1632