#include <bits/stdc++.h>   using namespace std;   long long jc[210000], ny[210000];   char s[210000];   int n, f[210000], g[210000], ans;   int C(int n, int m) {     if (m > n) return 0;     return jc[n] * ny[m] % 1000000007 * ny[n - m] % 1000000007;   }   int main() {     scanf( %s , s + 1);     n = strlen(s + 1);     for (int i = 1; i <= n; i++) {       f[i] = f[i - 1];       if (s[i] ==  ( ) f[i]++;     }     for (int i = n; i >= 1; i--) {       g[i] = g[i + 1];       if (s[i] ==  ) ) g[i]++;     }     jc[0] = jc[1] = ny[0] = ny[1] = 1;     for (int i = 2; i <= n; i++)       jc[i] = jc[i - 1] * i % 1000000007,       ny[i] = (long long)(-1000000007 / i) * ny[1000000007 % i] % 1000000007;     for (int i = 2; i <= n; i++) ny[i] = ny[i] * ny[i - 1] % 1000000007;     for (int i = 1; i <= n; i++)       if (s[i] ==  ( ) ans = (ans + C(f[i] + g[i] - 1, f[i])) % 1000000007;     ans = (ans + 1000000007) % 1000000007;     printf( %d n , ans);     return 0;   }   