#include using namespace std; #include using namespace atcoder; using ll=long long; using Graph=vector>; #define MAX 2000005 #define MOD 1000000007 //#define MOD 998244353 #define INF 1000000000 //#define INF 1000000000000000000 int main(){ int N; cin>>N; vector P(N); for(int i=0;i>P[i]; } ll win_cnt=0; ll lose_cnt=0; ll draw_cnt=0; for(int i=0;i50){ ll a=(win_cnt+lose_cnt+1)%MOD; ll b=(lose_cnt+win_cnt)%MOD; win_cnt=a; lose_cnt=b; draw_cnt=2*draw_cnt%MOD; }else if(P[i]<50){ ll a=2*win_cnt%MOD; ll b=(2*lose_cnt+1)%MOD; win_cnt=a; lose_cnt=b; draw_cnt=2*draw_cnt%MOD; }else{ draw_cnt=(draw_cnt+win_cnt+lose_cnt+1)%MOD; } } //p(1-q)+q(1-p)>pq+(1-p)(1-q) //p+q-2pq>2pq-p-q+1 //0>4pq-2p-2q+1 //0>(2p-1)*(2q-1) cout<