{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou are given an angle $$$\\text{ang}$$$. \u003c/p\u003e\n\u003cp\u003eThe Jury asks You to find such \u003cspan class\u003d\"tex-font-style-bf\"\u003eregular\u003c/span\u003e $$$n$$$-gon (regular polygon with $$$n$$$ vertices) that it has three vertices $$$a$$$, $$$b$$$ and $$$c$$$ (they can be non-consecutive) with $$$\\angle{abc} \u003d \\text{ang}$$$ or report that there is no such $$$n$$$-gon.\u003c/p\u003e\n\u003ccenter\u003e \n \u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/9654a57eb6447d250df0e1015f40b49a?v\u003d1653758678\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e \n\u003c/center\u003e\n\u003cp\u003eIf there are several answers, print the \u003cspan class\u003d\"tex-font-style-bf\"\u003eminimal\u003c/span\u003e one. It is guarantied that if answer exists then it doesn\u0027t exceed $$$998244353$$$.\u003c/p\u003e\n\u003chr/\u003e\n给你一个角度 $ang$,问一个最小的 $n$,使得正 $n$ 边形中存在三个点,夹角正好是 $ang$。"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains single integer $$$T$$$ ($$$1 \\le T \\le 180$$$) — the number of queries. \u003c/p\u003e\n\u003cp\u003eEach of the next $$$T$$$ lines contains one integer $$$\\text{ang}$$$ ($$$1 \\le \\text{ang} \u0026lt; 180$$$) — the angle measured \u003cspan class\u003d\"tex-font-style-bf\"\u003ein degrees\u003c/span\u003e. \u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each query print single integer $$$n$$$ ($$$3 \\le n \\le 998244353$$$) — minimal possible number of vertices in the regular $$$n$$$-gon or $$$-1$$$ if there is no such $$$n$$$.\u003c/p\u003e"}},{"title":"Sample 1","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\u003e4\n54\n50\n2\n178\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e10\n18\n90\n180\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eThe answer for the first query is on the picture above.\u003c/p\u003e\n\u003cp\u003eThe answer for the second query is reached on a regular $$$18$$$-gon. For example, $$$\\angle{v_2 v_1 v_6} \u003d 50^{\\circ}$$$.\u003c/p\u003e\n\u003cp\u003eThe example angle for the third query is $$$\\angle{v_{11} v_{10} v_{12}} \u003d 2^{\\circ}$$$.\u003c/p\u003e\n\u003cp\u003eIn the fourth query, minimal possible $$$n$$$ is $$$180$$$ (not $$$90$$$).\u003c/p\u003e"}}]}