{"problem":{"name":"4-adjacent","description":{"content":"We have a sequence of length $N$, $a = (a_1, a_2, ..., a_N)$. Each $a_i$ is a positive integer. Snuke's objective is to permute the element in $a$ so that the following condition is satisfied: *   Fo","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc080_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $2 ≤ N ≤ 10^5$\n*   $a_i$ is an integer.\n*   $1 ≤ a_i ≤ 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc080_a","tags":[],"sample_group":[["3\n1 10 100","Yes\n\nOne solution is $(1, 100, 10)$."],["4\n1 2 3 4","No\n\nIt is impossible to permute $a$ so that the condition is satisfied."],["3\n1 4 1","Yes\n\nThe condition is already satisfied initially."],["2\n1 1","No"],["6\n2 7 1 8 2 8","Yes"]],"created_at":"2026-03-03 11:01:13"}}