{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence of positive integers $A=(a_1,\\ldots,a_N)$ of length $N$.  \nThere are $(2^N-1)$ ways to choose one or more terms of $A$. How many of them have an integer-valued average? Find the count modulo $998244353$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $1 \\leq a_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $\\ldots$ $a_N$"},{"iden":"sample input 1","content":"3\n2 6 2"},{"iden":"sample output 1","content":"6\n\nFor each way to choose terms of $A$, the average is obtained as follows:\n\n*   If just $a_1$ is chosen, the average is $\\frac{a_1}{1}=\\frac{2}{1} = 2$, which is an integer.\n    \n*   If just $a_2$ is chosen, the average is $\\frac{a_2}{1}=\\frac{6}{1} = 6$, which is an integer.\n    \n*   If just $a_3$ is chosen, the average is $\\frac{a_3}{1}=\\frac{2}{1} = 2$, which is an integer.\n    \n*   If $a_1$ and $a_2$ are chosen, the average is $\\frac{a_1+a_2}{2}=\\frac{2+6}{2} = 4$, which is an integer.\n    \n*   If $a_1$ and $a_3$ are chosen, the average is $\\frac{a_1+a_3}{2}=\\frac{2+2}{2} = 2$, which is an integer.\n    \n*   If $a_2$ and $a_3$ are chosen, the average is $\\frac{a_2+a_3}{2}=\\frac{6+2}{2} = 4$, which is an integer.\n    \n*   If $a_1$, $a_2$, and $a_3$ are chosen, the average is $\\frac{a_1+a_2+a_3}{3}=\\frac{2+6+2}{3} = \\frac{10}{3}$, which is not an integer.\n    \n\nTherefore, $6$ ways satisfy the condition."},{"iden":"sample input 2","content":"5\n5 5 5 5 5"},{"iden":"sample output 2","content":"31\n\nRegardless of the choice of one or more terms of $A$, the average equals $5$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}