{"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":"MD","content":"Consider the following function:\n```\n function SORCERY(N):\n RES :\u003d 0\n for i \u003d 1 upto 5\n if i equals to 5\n return (RES modulo i)\n else\n RES :\u003d RES + i^N\n end if\n end for\n end function\n```\nYour task is to rewrite the `SORCERY` function in an optimal manner.\n\nHere \u003cb\u003e^\u003c/b\u003e denotes power sign."}},{"title":"Input","value":{"format":"MD","content":"Input consists of a single integer **N (0 ≤ N ≤ 10\u003csup\u003e10\u003csup\u003e5\u003c/sup\u003e\u003c/sup\u003e)** — the input to the function."}},{"title":"Output","value":{"format":"MD","content":"Print the value returned by the function."}},{"title":"Sample Input 1","value":{"format":"MD","content":"`4`"}},{"title":"Sample Output 1","value":{"format":"MD","content":"`4`"}},{"title":"Sample Input 2","value":{"format":"MD","content":"`1`"}},{"title":"Sample Output 2","value":{"format":"MD","content":"`0`"}},{"title":"Note","value":{"format":"MD","content":"The *modulo* operation finds the remainder after the division of one number by another."}}]}