hdu3863找规律

先画一下N=2的情况，先手胜，再画一下N=3的情况，先手胜，所以大胆的猜测，无论N=多少，先手胜！！

这也能A真是个奇迹

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-9;
const int N=1000000+10,maxn=1234567,inf=11111;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    while(cin>>n){
        if(n==-1)break;
        cout<<"I bet on Oregon Maple~"<<endl;
    }
    return 0;
}