#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define ary(k) array<int, k>
typedef pair<int, int> pii;
typedef vector<int> vi;

ary(4) elems[302];
int dp[302][302*302];

bool cmp(ary(4) a, ary(4) b) {
    bool ag = a[0] >= a[1];
    bool bg = b[0] >= b[1];
    if (ag != bg)
        return ag > bg;
    if (ag) {
        return a[1] < b[1];
    } else {
        return a[0] > b[0];
    }
}

signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        elems[i][3] = sz(s);
        int akt = 0;
        for (auto c : s) {
            if (c == ')')
                akt--;
            else
                akt++;
            cmx(elems[i][1], -akt);
        }
        elems[i][2] = akt;
        reverse(all(s));
        akt = 0;
        for (auto c : s) {
            if (c == '(')
                akt--;
            else
                akt++;
            cmx(elems[i][0], -akt);
        }
        reverse(all(s));
//        cerr << s << " " << elems[i][0] << " " << elems[i][1] << " " << elems[i][2] << " " << elems[i][3] << "\n";
    }
    sort(elems, elems+n, cmp);
    dp[0][0] = 0;
    for (int val = 1; val < 300*300; val++)
        dp[0][val] = -1e9;
    for (int i = 1; i <= n; i++) {
        for (int val = 0; val < 300*300; val++)
            dp[i][val] = dp[i-1][val];
        for (int val = 0; val < 300*300; val++) {
            if (val >= elems[i-1][1]) {
//                cerr << val << " " << elems[i-1][1] << " " << elems[i-1][2] << "\n";
                cmx(dp[i][val+elems[i-1][2]], dp[i-1][val] + elems[i-1][3]);
            }
        }
//        for (int val = 0; val < 300*300; val++)
//            if (dp[i][val] >= 0)
//                cerr << i << " " << val << " " << dp[i][val] << "\n";
    }
    cout << dp[n][0] << "\n";
}