{"raw_statement":[{"iden":"problem statement","content":"We have a sequence of length $N$, $a = (a_1, a_2, ..., a_N)$. Each $a_i$ is a positive integer.\nSnuke's objective is to permute the element in $a$ so that the following condition is satisfied:\n\n*   For each $1 ≤ i ≤ N - 1$, the product of $a_i$ and $a_{i + 1}$ is a multiple of $4$.\n\nDetermine whether Snuke can achieve his objective."},{"iden":"constraints","content":"*   $2 ≤ N ≤ 10^5$\n*   $a_i$ is an integer.\n*   $1 ≤ a_i ≤ 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$"},{"iden":"sample input 1","content":"3\n1 10 100"},{"iden":"sample output 1","content":"Yes\n\nOne solution is $(1, 100, 10)$."},{"iden":"sample input 2","content":"4\n1 2 3 4"},{"iden":"sample output 2","content":"No\n\nIt is impossible to permute $a$ so that the condition is satisfied."},{"iden":"sample input 3","content":"3\n1 4 1"},{"iden":"sample output 3","content":"Yes\n\nThe condition is already satisfied initially."},{"iden":"sample input 4","content":"2\n1 1"},{"iden":"sample output 4","content":"No"},{"iden":"sample input 5","content":"6\n2 7 1 8 2 8"},{"iden":"sample output 5","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}