#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int N, K;

bool cmp(const pii &a, const pii &b){
    if(a.first == b.first) return a.second < b.second;
    return a.first < b.first;
}

struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;

vi dist;
int d[110][110];

bool bellman_ford(int n, int s) { // nは頂点数、sは開始頂点
    dist = vector<int>(n, INF);
    dist[s] = 0; // 開始点の距離は0
    for (int i = 0; i < n; i++) {
        for (int v = 0; v < n; v++) {
            for (int u = 0; u < n; u++) {
                if (dist[v] != INF && dist[u] > dist[v] + d[v][u]) {
                    dist[u] = dist[v] + d[v][u];
                    if (i == n - 1) return true; // n回目にも更新があるなら負の閉路が存在
                }
            }
        }
    }
    return false;
}


int main() {
    //cout << fixed << setprecision(15);

    string s; cin >> s;
    int n = s.size();


    int ans=0;
    for(int i=1; i<n-1; ++i){
        if(s[i-1]=='i' && s[i]=='w' && s[i+1]=='i'){

            string s1="", s2="";
            for(int j=i-2; j>=0; j--){
                if(s[j]=='i' || s[j]=='w') break;
                s1 += s[j];
            }
            for(int j=i+2; j<n; ++j){
                if(s[j]=='i' || s[j]=='w') break;
                if(s[j]=='[') s2 += ']';
                if(s[j]=='(') s2 += ')';
                if(s[j]==')') s2 += '(';
                if(s[j]==']') s2 += '[';
                if(s[j]=='{') s2 += '}';
                if(s[j]=='}') s2 += '{';
            }

            int n1 = s1.size(), n2 = s2.size();

            int dp[20][20]={0};
            for(int j=0; j<n1; ++j){
                for(int l=0; l<n2; ++l){
                    if(s1[j] == s2[l]){
                        dp[j+1][l+1] = max(dp[j+1][l+1], dp[j][l]+1);
                    }else{
                        dp[j+1][l+1] = max(dp[j+1][l], dp[j][l+1]);
                    }
                }
            }
            ans = max(ans, 3 + dp[n1][n2]*2);
        }
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 3212