Problem:
Score : 900 points

Problem Statement

You are developing frog-shaped robots, and decided to race them against each other.

First, you placed N robots onto a number line.
These robots are numbered 1 through N.
The current coordinate of robot i is x_i.
Here, all x_i are integers, and 0 < x_1 < x_2 < ... < x_N.

You will repeatedly perform the following operation:

Select a robot on the number line. Let the coordinate of the robot be x. Select the destination coordinate, either x-1 or x-2, that is not occupied by another robot. The robot now jumps to the selected coordinate.

When the coordinate of a robot becomes 0 or less, the robot is considered finished and will be removed from the number line immediately.
You will repeat the operation until all the robots finish the race.

Depending on your choice in the operation, the N robots can finish the race in different orders.
In how many different orders can the N robots finish the race?
Find the answer modulo 10^9+7.

Constraints

2 ≤ N ≤ 10^5

x_i is an integer.

0 < x_1 < x_2 < ... < x_N ≤ 10^9

Partial Score

In a test set worth 500 points, N ≤ 8.

Input

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

N
x_1 x_2 ... x_N

Output

Print the number of the different orders in which the N robots can finish the race, modulo 10^9+7.

Sample Input 1

3
1 2 3

Sample Output 1

4

There are four different orders in which the three robots can finish the race:

(Robot 1 → Robot 2 → Robot 3)

(Robot 1 → Robot 3 → Robot 2)

(Robot 2 → Robot 1 → Robot 3)

(Robot 2 → Robot 3 → Robot 1)

Sample Input 2

3
2 3 4

Sample Output 2

6

There are six different orders in which the three robots can finish the race:

(Robot 1 → Robot 2 → Robot 3)

(Robot 1 → Robot 3 → Robot 2)

(Robot 2 → Robot 1 → Robot 3)

(Robot 2 → Robot 3 → Robot 1)

(Robot 3 → Robot 1 → Robot 2)

(Robot 3 → Robot 2 → Robot 1)

For example, the order (Robot 3 → Robot 2 → Robot 1) can be achieved as shown in the figure below:

Sample Input 3

8
1 2 3 5 7 11 13 17

Sample Output 3

10080

Sample Input 4

13
4 6 8 9 10 12 14 15 16 18 20 21 22

Sample Output 4

311014372

Remember to print the answer modulo 10^9+7.
This case is not included in the test set for the partial score.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int mod = 1e9+7;
int n, a[100001], b[100001], cnt[100001];
int FF(int start, int num){
    return max(num-(start+1)/2, 0);
}

bool meet(int p1, int p2, int num){
    return (p2-2*(num-1)) <= (p1+1);
}

struct Elem{
    int place, num;
    Elem(int place, int num){
		this->place=place;
		this->num=num;
	}
};

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
		scanf("%d", &a[i]);

	vector<Elem> V;
	V.push_back(Elem(a[1], 1));

	for(int i=2; i<=n; i++){
		V.push_back(Elem(a[2], 1));
		while(V.size()>=2){
			unsigned int p=V.size()-2;
			unsigned int q=V.size()-1;

			if(meet(V[p].place, V[q].place, V[q].num)){
				V[p].place=V[q].place;
				V[p].num+=V[q].num;
				V.pop_back();
			}
			else break;
		}

		b[i]=FF(V[0].place, V[0].num);
	}

	cnt[1]++;
	for(int i=2; i<=n; i++)
		cnt[b[i-1]+1]++;

	long long ans = 1;
	int sum=0;
	for(int i=1; i<=n; i++){
		sum+=cnt[i];
		ans=ans*sum%mod;
		sum--;
	}
	printf("%lld", ans);
	return 0;
}