Submission #8889088

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
    vector.erase(vector.begin() + index);
}

typedef long long ll;

ll INF = 100000000000000;
ll MOD = 1e9+7;

vector<ll> A;

void Primefactor(ll n){
  ll a = n;
  for(ll i = 2;i * i <= n;i++){
    while(a % i == 0){
      A.push_back(i);
      a /= i;
    }
    if(a == 1){
      break;
    }
  }
  if(a != 1){
    A.push_back(a);
  }
  return;
}

int main(){
   ll N;cin >> N;
   ll n = 0;
   for(int i = 1;i <= N;i++)n += i;
   Primefactor(n);
   if(N == 1){
       cout << "BOWWOW" << endl;
       return 0;
   }
   if(A.size() > 1){
       cout << "BOWWOW" << endl;
   }else{
       cout <<  "WANWAN" << endl;
   }
}

Submission Info

Judge Result