{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"\u003cp\u003e \u003c/p\u003e\n\u003cp\u003eMark Zukerburg and Elon Musk are meeting after a long time. As usual they love to play some math games. This time Mark takes the call and decides the game. The game is very simple, Mark says out an integer and Elon has to say whether the number is prime or not. Elon as usual knows the logic but since Mark doesn\u0027t give Elon much time to think, so Elon decides to write a computer program.\u003c/p\u003e\n\u003cp\u003eHelp Elon accomplish this task by writing a computer program which will calculate whether the number is prime or not .\u003c/p\u003e\n\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003eThe first line of the input contains an integer T, the number of testcases. T lines follow. \u003c/p\u003e\n\u003cp\u003e Each of the next T lines contains an integer N which has to be tested for primality. \u003c/p\u003e\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003e\nFor each test case output in a separate line, \"yes\" if the number is prime else \"no.\"\n\u003c/p\u003e\n\n\u003ch3\u003eConstraints\u003c/h3\u003e \n\u003cul\u003e\n\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eT\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 20\u003c/li\u003e\n\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eN\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 100000\u003c/li\u003e\n\u003c/ul\u003e"}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\n23\n13\n20\n1000\n99991\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eyes\nyes\nno\nno\nyes\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}