Problem: 

Interaction

This is an interactive problem. You need to read participants' queries from standard input and print your responses to standard output. You don't know the number of queries upfront, so you'll need to process them as you get them; you'll know you're done once you reach the end of the file.

In each query, you will be asked the question, written in one line. You have to answer it correctly, patiently and without any display of emotions. Your response is case-insensitive.

Please make sure to use the stream flushing operation after each response in order not to leave part of your output in some buffer.

Example

Input


Is it rated?
Is it rated?
Is it rated?


Output


NO
NO
NO

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define int                                        long long
#define TEST                                       int t; cin>>t; while(t--)
#define pb                                         push_back
#define pii                                        pair <int, int>
#define vi                                         vector <int>
#define ff                                         first
#define ss                                         second
#define sz(v)                                      (int)v.size()
#define vpii                                       vector <pair <int, int>>
#define vvi                                        vector <vector <int> >
#define all(x)                                     (x).begin(), (x).end()
#define rall(x)                                    (x).rbegin(), (x).rend()
#define endl                                       "\n"
#define MAX                                        1e18
#define MIN                                        INT_MIN
#define mod                                        1000000007
typedef long long                                  ll;
//int lcm(int a, int b) {return (a * b) / (__gcd(a, b));}
//----------------------------------SEIVE---------------------------------------------//
// set<int>prime;
// bitset<1000030>vis;
// void seive()
// {

//   vis.set();
//   vis[0] = false;
//   vis[1] = false;
//   vis[2] = true;
//   prime.insert(2);

//   for (int i = 3; i <= 1000030; i += 2)

//     if (vis[i] == 1)
//     {
//       prime.insert(i);
//       for (int j = i * i; j <= 1000030; j += i)
//       {
//         vis[j] = 0;
//       }
//     }

// }
//----------------------------------SEIVE---------------------------------------------//

// bool isPrime(int n)
// {
//   if (n < 2) return false;
//   if (n < 4) return true;
//   if (!(n & 1))   return false;
//   if (n % 3 == 0) return false;

//   int lim = sqrt(n);
//   for (int i = 5; i <= lim; i += 6)
//     if (n % i == 0 || n % (i + 2) == 0)
//       return false;

//   return true;
// }

// int maxSubArraySum(int a[],int size)
// {
//   //KADANE'S AlGORITHM
//   int sumsofar=INT_MIN,sumhere=0;
//   for(int i=0;i<size;i++){
//    sumhere+=a[i];
//    if(sumhere>sumsofar){
//       sumsofar=sumhere;}
//    if(sumhere<0)
//     sumhere=0;
//   }
//   return sumsofar;
// }

// map<int, int> primeFact(int n) {
//   map<int, int> mp;
//   while (n % 2 == 0) {
//     mp[2]++;
//     n = n / 2;
//   }
//   for (int i = 3; i <= sqrt(n); i += 2) {
//     while (n % i == 0) {
//       mp[i]++;
//       n = n / i;
//     }
//   }
//   if (n > 2) {
//     mp[n]++;
//   }
//   return mp;
// }

// int binomialCoeff(int n, int k)
// {
//   if (k > n)return 0;
//   int C[n + 1][k + 1];
//   int i, j;
//   for (i = 0; i <= n; i++) {
//     for (j = 0; j <= min(i, k); j++) {
//       if (j == 0 || j == i)
//         C[i][j] = 1;
//       else
//         C[i][j] = (C[i - 1][j - 1] % (mod) + C[i - 1][j] % (mod)) % (mod);
//     }
//   }
//   return C[n][k];
// }

// int countDivisors(int n) {
//   int cnt = 0;
//   for (int i = 1; i <= sqrt(n); i++) {
//     if (n % i == 0) {
//       if (n / i == i)cnt++;
//       else {
//         cnt += 2;
//       }
//     }
//   }
//   return cnt;
// }

// int reverse_number(int n) {
//   int rev = 0, r;
//   while (n != 0) {
//     r = n % 10;
//     rev = rev * 10 + r;
//     n /= 10;
//   }
//   return rev;
// }

// int perfectSquare(int n) {
//   int h = n & 0xF;
//   if (h > 9)return 0;
//   if (h != 2 && h != 3 && h != 5 && h != 6 && h != 7 && h != 8) {
//     int x = (int)floor(sqrt((double)n) + 0.5);
//     return x * x == n;
//   }
//   return 0;
// }

void solve() {
  string s = "Is it rated?";
  while (getline(cin, s)) {
    cout << "NO" << endl;
    cout.flush();
  }
}
signed main()
{
// #ifndef ONLINE_JUDGE
//   freopen("input.txt", "r", stdin);
//   freopen("output.txt", "w", stdout);
// #endif
  mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
  ios_base :: sync_with_stdio(0);
  cin.tie(0);
  //seive();

  //TEST
  solve();

}