Submission #2834659

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
using ll = long long;
const ll mod = 1000000007;
int n, m;
using namespace std;
int main(){
	cin >> n;
    if((n-1)/3%2==0) cout << "SEN" << endl;
    else cout << "GO" << endl;
    return 0;
}

Submission Info

Judge Result