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 JAVA):

Solution:

//..............Learning.........//



import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.BigInteger;

public class A {

static FastReader		sc	= new FastReader();
static PrintWriter	out	= new PrintWriter(System.out);

public static void main(String[] args) throws Exception {
//	try {
//
	Scanner sc=new Scanner(System.in);
	int c=0;
	while (sc.hasNext()) { 
		String line=sc.nextLine();
		if(line.equals("Is it rated?")) {
			System.out.println("NO");
		}else {
			throw null;
		}
//		System.out.println(1);
		
	}
	
	
//	
//	while(sc.nextLine().length()!=0) {
////		String s=sc.nextLine();
////		
////		System.out.println(c);
////		System.out.flush();
//////		System.out.println(1);
////		System.out.flush();
//		c++;
//	}


//	BufferedReader reader = null;  
//  reader= new BufferedReader(new InputStream);
//	String line = null;
//	while ((line = reader.readLine()) != null) {
//	    // do something with every line, one at a time
//	}
	
//	System.out.println(c);
//	for(int i=0;i<c/3;i++) {
//		System.out.println("NO");
//		System.out.flush();
//	}
	sc.close();
	
//	} catch (Exception e) {
//		return;
//	}
}


static HashSet<Integer>	set		= new HashSet<Integer>();

//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Code Starts <<<<<<<<<<<<<<<<<<<<<<<<<<<<< //

static void go() {
//	String s=sc.next();
//	out.println("NO");
//	out.flush();
//	out.flush();
}

//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Code Ends <<<<<<<<<<<<<<<<<<<<<<<<<<<<< //

static long gcd(long a, long b) {
	if (b==0) {
		return a;
	}return gcd(b, a%b);
}
static int	prime[]	= new int[200005];
static int	N				= 200005;
static void sieve() {

	for(int i=0;i<N;i++) {
		prime[i]=i;
}
	for (int i = 2; i * i <= N; i++) {
		if (prime[i] == i) {
			prime[i]=i;
			for (int j = i; j < N; j += i) {
				prime[j] =i;
			}}}
}


static int gcd(int a, int b) {
	if (b == 0) {
		return a;
	}return gcd(b, a % b);
}
 static void sort(int[] a) {
	ArrayList<Integer> aa = new ArrayList<>();
	for (Integer i : a) {
		aa.add(i);	}
	Collections.sort(aa);
	for (int i = 0; i < a.length; i++)
		a[i] = aa.get(i);}
static void sort(long[] a) {
	ArrayList<Long> aa = new ArrayList<>();
	for (Long i : a) {
		aa.add(i);}
	Collections.sort(aa);
	for (int i = 0; i < a.length; i++)
		a[i] = aa.get(i);
}

static int mod = (int) 1e9 + 7;

static long pow(long x, long y) {
	long res = 1l;
	while (y != 0) {
		if (y % 2 == 1) {
			res = (x * res);
			}	y /= 2;x = (x * x);
	}
	return res;
}


//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Fast IO <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< //

static class FastReader {
	BufferedReader	br;
	StringTokenizer	st;
	public FastReader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}		String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}		}	return st.nextToken();
	}	int nextInt() {
		return Integer.parseInt(next());
	}	long nextLong() {
		return Long.parseLong(next());
	}	double nextDouble() {
		return Double.parseDouble(next());
	}		String nextLine() {
		String str = "";
		try {
			str = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		return str;
	}	}}
class dsu {
  int  parent[];
  int  n;

  dsu(int n) {
    this.n = n;
    parent = new int[n];
    for (int i = 0; i < n; i++) {
      parent[i] = i;
    }
  }

  int find(int x) {
    if (parent[x] == x) {
      return x;
    }
    return find(parent[x]);
  }

  boolean union(int x, int y) {
    int x_parent = find(x);
    int y_parent = find(y);
    if (x_parent == y_parent) {
      return false;
    }
    
 
    parent[y_parent] = x_parent;
    return true;
  }

}