{"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":"PLAIN","content":"We have got zombies in our city.All zomvies hve certain power denoted y integers.However there is a weak point of the zombies,when one zombie among all has same power as sum of all other zombies then they fight against themselves and all die.For saving the city we have to eliminate all the zombies.\n\nPowers of zomie i is given y Ai,\nyou have to return the indices of those zomies which you have to kill to finish all zombies.\nEg:\nInput:\n[8 5 3 2]\n\nNow if we kill zombie at index 0 ,arr:[5 3 2] and as 5\u003d3+2, theyll fight against themselves and all die.\n\nNow if we kill zombie at index 3 ,arr:[8 5 3] and as 8\u003d5+3, theyll fight against themselves and all die.\n\nOutput:\n2 // numer of such indexes possile\n1 4 //those indexes\n\n "}},{"title":"Input","value":{"format":"PLAIN","content":"The first line of the input contains one integer n (2≤n≤2⋅105) — the number of elements in the array a.\n\nThe second line of the input contains n integers a1,a2,…,an (1≤ai≤106) — elements of the array a"}},{"title":"Output","value":{"format":"PLAIN","content":"In the first line print one integer k — the number of indices j of the array a such that after removing the j-th element from the array it will be good (i.e. print the number of the nice indices).\n\nIn the second line print k distinct integers j1,j2,…,jk in any order — nice indices of the array a.\n\nIf there are no such indices in the array a, just print 0 in the first line and leave the second line empty or do not print it at all."}},{"title":"Examples","value":{"format":"PLAIN","content":"Input\n5\n2 5 1 2 2\nOutput\n3\n4 1 5\nInput\n4\n8 3 5 2\nOutput\n2\n1 4 \nInput\n5\n2 1 2 4 3\nOutput\n0"}}]}