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:
/*
    Author: Uday Gupta
*/

#include<bits/stdc++.h> 
#include  <iostream>
#include<unordered_map>
using namespace std;
#pragma warning(disable : 4996)

//----------define start----------//
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
//#define endl "\n"
typedef long long ll;
#define int ll
#define sz(x) ((int)x.size())
#define rep(i, n)    for(int i = 0; i < (n); ++i)
#define repA(i, a, n)  for(int i = a; i <= (n); ++i)
#define repD(i, a, n)  for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define fill(a)  memset(a, 0, sizeof (a))
//----------define end----------//

//----------const start----------//
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e18;
//----------const end----------//

//----------typedef start----------//
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
//----------typedef end----------//


//----------global variables start----------//
//int n;
//string s;
//vector<int> a(N);
//vector<vector<int>> memo_table(N, vector<int>(4));
//----------global variables end----------//
ll po(ll x, ll y, ll p = mod) { ll res = 1; x %= p; while (y > 0) { if (y & 1)res = (res * x) % p; y = y >> 1; x = (x * x) % p; }return res; }
ll inv(ll x, ll p = mod) { return po(x, p - 2); }


long long gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}


long long lcm(int a, int b)
{
    return (a / gcd(a, b)) * b;
}


void solve()
{
    string s;
    getline(cin, s);
    while (s == "Is it rated?") {
        cout << "NO" << endl;
        getline(cin, s);        
    }
}


signed main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);

#ifndef ONLINE_JUDGE 
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
#endif

    int t = 0;
    int test_cases = 1;
    //cin >> test_cases;
    //cout << fixed << setprecision(6);
    while (t++ < test_cases)
    {	//cout << "Case #" << t << ": ";
        solve();
        cout << "\n";
    }

    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;

    return 0;
}