Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on.

When a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if i-th garland is switched on during x-th second, then it is lit only during seconds x, x + ki, x + 2ki, x + 3ki and so on.

Mishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers x1, x2 and x3 (not necessarily distinct) so that he will switch on the first garland during x1-th second, the second one — during x2-th second, and the third one — during x3-th second, respectively, and during each second starting from max(x1, x2, x3) at least one garland will be lit.

Help Mishka by telling him if it is possible to do this!

The first line contains three integers k1, k2 and k3 (1 ≤ ki ≤ 1500) — time intervals of the garlands.

If Mishka can choose moments of time to switch on the garlands in such a way that each second after switching the garlands on at least one garland will be lit, print YES.

Otherwise, print NO.

In the first example Mishka can choose x1 = 1, x2 = 2, x3 = 1. The first garland will be lit during seconds 1, 3, 5, 7, ..., the second — 2, 4, 6, 8, ..., which already cover all the seconds after the 2-nd one. It doesn''t even matter what x3 is chosen. Our choice will lead third to be lit during seconds 1, 4, 7, 10, ..., though.

In the second example there is no way to choose such moments of time, there always be some seconds when no garland is lit.

#include<bits/stdc++.h>
using namespace std;
const int M = 2e5+100;
int a[M],t[M];
void merge_sort(int x, int y, int & ans){
    if(y-x>1){
        int m = x+(y-x)/2;
        int p=x, q=m, i=x;
        merge_sort(x, m, ans);
        merge_sort(m ,y, ans);
        while(p<m || q<y){
            if(q>=y || p<m && a[p]<=a[q]){
                t[i++] = a[p++];
            }
            else{
                t[i++] = a[q++];
                ans += m-p;
            }
        }
        for(int j=x; j<y; j++){
            a[j] = t[j];
        }
    }
}

int main(){
    int n,q,l,r;
    cin>>n;
    for(int i = 0;i < n; i++){
        cin>>a[i];
    }
    int ans = 0;
    merge_sort(0,n,ans);
    if(ans % 2 == 0)
        ans = 0;
    else
        ans = 1;
    cin>>q;
    while(q--){
        cin>>l>>r;
        int len = r - l + 1;
        len/=2;
        if(len % 2 == 0){
            if(ans == 0) cout<<"even"<<endl;
            else cout<<"odd"<<endl;
        }
        else{
            if(ans == 0){ ans = 1; cout<<"odd"<<endl;}
            else{ ans = 0; cout<<"even"<<endl;}
        }
    }
    return 0;
}