{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eNow it\u0027s time for lunch. Today\u0027s menu is chocolate!\u003cbr\u003e\u003cbr\u003eThough every baby likes chocolate, the appetites of babies are little. After lunch, there are still $n$ pieces of chocolate remained: The length of the $i$th piece is $l_i$.\u003cbr\u003e\u003cbr\u003eUsing the remained chocolate, Baby Volcano is going to play a game with his teacher, Mr. Sprague. The rule of the game is quite simple.\u003cbr\u003e\u003cbr\u003eTwo player plays in turns, and Baby Volcano will play first:\u003cbr\u003e\u003cbr\u003e1. In each turn, the player needs to select one piece of chocolate. If the length of the selected piece is equal to $1$, the player of this turn will lose immediately.\u003cbr\u003e2. Suppose the length of the selected piece is $l$. Then the player needs to select a positive integer $k$ satisfying $k$ is at least $2$ and $k$ is a factor of $l$.\u003cbr\u003e3. Then the player needs to cut the selected piece into $k$ pieces with length $\\frac{l}{k}$.\u003cbr\u003e\u003cbr\u003eThe game continues until one player selects a piece of chocolate with length $1$.\u003cbr\u003e\u003cbr\u003eSuppose both players plays optimally, your task is to determine whether Baby Volcano will win.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains single integer $t (1 \\leq t \\leq 2 * 10^4)$, the number of testcases.\u003cbr\u003e\u003cbr\u003eFor each testcase, the first line contains a single integer $n (1 \\leq n \\leq 10)$.\u003cbr\u003e\u003cbr\u003eThe second line contains $n$ positive integers $l_i (1 \\leq l_i \\leq 10^9)$, representing the length of each piece."}},{"title":"Output","value":{"format":"HTML","content":"For each testcase, output char \u0027W\u0027 if Baby Volcano will win, otherwise output char \u0027L\u0027."}},{"title":"Sample","value":{"format":"HTML","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\u003e3\r\n2\r\n4 9\r\n2\r\n2 3\r\n3\r\n3 9 27\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eW\r\nL\r\nL\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}