AtCoder Beginner Contest 050
C
Lining Up
AtCoder
⌀ 952
原题
← BD →
翻译中…

Problem Statement

翻译中…

There are $N$ people, conveniently numbered $1$ through $N$. They were standing in a row yesterday, but now they are unsure of the order in which they were standing. However, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person. According to their reports, the difference above for person $i$ is $A_i$.

翻译中…

Based on these reports, find the number of the possible orders in which they were standing. Since it can be extremely large, print the answer modulo $10^9+7$. Note that the reports may be incorrect and thus there may be no consistent order. In such a case, print $0$.

翻译中…

Constraints

翻译中…
  • $1≦N≦10^5$
  • $0≦A_i≦N-1$
翻译中…

Input

翻译中…

The input is given from Standard Input in the following format:

翻译中…

N
A_1 A_2 ... A_N

翻译中…

Output

翻译中…

Print the number of the possible orders in which they were standing, modulo $10^9+7$.

翻译中…

样例

Input #1
5
2 4 4 0 2
Output #1
4
There are four possible orders, as follows: - $2,1,4,5,3$ - $2,5,4,1,3$ - $3,1,4,5,2$ - $3,5,4,1,2$
Input #2
7
6 4 0 2 4 0 2
Output #2
0
Any order would be inconsistent with the reports, thus the answer is $0$.
Input #3
8
7 5 1 1 7 3 5 3
Output #3
16
题目信息
题号
arc066_a
时间限制
2 s
内存限制
256 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。