#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<cmath>
#include<cctype>
#include<ctime>
#include<bitset>
using namespace std;
const int maxlongint=2147483647;
const int inf=1000000000;
const int mod=inf+7;
int ksm(int i,int j)
{
    long long k=i,l=1;
    while(j)
    {
        if(j&1)
            l=l*k%mod;
        k=k*k%mod;
        j=j>>1;
    }
    return l;
}
long long jc[1000010];
int c(int i,int j)
{
    if(j>i||j<0)
        return 0;
    return jc[i]*ksm(jc[j],mod-2)%mod*ksm(jc[i-j],mod-2)%mod;
}
char s[1000010];
int main()
{
    int n;
    jc[0]=1;
    for(int i=1;i<=1000000;i++)
        jc[i]=jc[i-1]*i%mod; 
    while(scanf("%d",&n)==1)
    {
        scanf("%s",s);
        int len=strlen(s),p=0;
        for(int i=0;i<len;i++)
        {
            if(s[i]=='(')
                p++;
            else
                p--;
            if(p<0)
                break;
        }
        if(p<0)
        {
            printf("0\n");
            continue;
        }
        if(n%2==1)
        {
            printf("0\n");
            continue;
        }
        printf("%d\n",(c(n-len,(n-len-p)/2)-c(n-len,(n-len-p)/2+p+1)+mod)%mod);
    }
}