#include<iostream>

#include<cstdio>

#include<stack>

using namespace std;

typedef long long LL;

const int maxn = 1e6 + ;

char str[maxn];

LL dp[maxn];

int pos[maxn];

void init() {

    memset(pos, , sizeof(pos));

    memset(dp, , sizeof(dp));

}

int main() {

    while (scanf("%s", str + ) == ) {

        int len = strlen(str + );

        init();

        stack<int> ms;

        for (int i = ; i <= len; i++) {

            if (str[i] == '(') {

                ms.push(i);

            }

            else {

                if (!ms.empty()) {

                    int j = ms.top(); ms.pop();

                    pos[i] = j;

                }

            }

        }

        LL ans = ;

        for (int i = ; i <= len; i++) {

            if(pos[i]>=) dp[i] = dp[pos[i] - ] + ;

            ans += dp[i];

        }

        printf("%lld\n", ans);

    }

    return ;

}