ll mod=1e9+7;
int n;
ll a[100010],dp[100010][2];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
dp[1][0]=1,dp[1][1]=a[1];
for(int i=2;i<=n;i++)
{
dp[i][0]=(dp[i-1][0]%mod+dp[i-1][1]%mod)%mod;
dp[i][1]=(dp[i-1][0]%mod+dp[i-1][1]%mod)%mod*a[i]%mod;
}
cout<<(dp[n][0]%mod+dp[n][1]%mod-1+mod)%mod<<"\n";
return 0;
}
char s[20];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>s;
int len=strlen(s);
sort(s,s+len);
ll s1=0,s2=0;
for(int i=len-1;i>=0;i--)
{
ll x=s[i]-'0';
if(s1<=s2)s1=s1*10+x;
else s2=s2*10+x;
}
cout<<s1*s2<<"\n";
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
int t,n,m,k;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>t;
while(t--)
{
cin>>n>>m>>k;
if(min(n,m)/2<k){cout<<"0\n";continue;}
int s1=1,s2=1;
for(int i=n-1,j=1;j<=(2*k-1);i--,j++)
{
s1=s1*i;
s2=s2*j;
}
int ans=s1/s2;
s1=1,s2=1;
for(int i=m-1,j=1;j<=(2*k-1);i--,j++)
{
s1=s1*i;
s2=s2*j;
}
ans=ans*(s1/s2);
cout<<ans<<"\n";
}
return 0;
}