#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
#define RREP(i, n)          for(int(i)=(n)-1;(i)>=0;--(i))
const int MOD = int(1e9+7);

int A[2000010];

int main(){
    int N,S,X,Y,Z,Q;
    cin >> N >> S >> X >> Y >> Z;

    A[1] = S;
    FOR(i,1,N) A[i+1] = (A[i]*X+Y) % Z;

    FOR(i,1,N+1) A[i] %= 2;

    cin >> Q;
    REP(i,Q){
        int s,t,u,v;
        cin >> s >> t >> u >> v;
        if(s < u){
            RREP(j,t-s+1) A[u+j] ^= A[s+j];
        } else {
            REP(j,t-s+1) A[u+j] ^= A[s+j];
        }
    }

    FOR(i,1,N+1) cout << (A[i]?"O":"E");
    cout << endl;
    return 0;
}