Problem: An accordion is a string (yes, in the real world accordions are musical instruments, but let's forget about it for a while) which can be represented as a concatenation of: an opening bracket (ASCII code 091), a colon (ASCII code 058), some (possibly zero) vertical line characters (ASCII code 124), another colon, and a closing bracket (ASCII code 093). The length of the accordion is the number of characters in it.

For example, [::], [:||:] and [:|||:] are accordions having length 4, 6 and 7. (:|:), {:||:}, [:], ]:||:[ are not accordions. 

You are given a string s. You want to transform it into an accordion by removing some (possibly zero) characters from it. Note that you may not insert new characters or reorder existing ones. Is it possible to obtain an accordion by removing characters from s, and if so, what is the maximum possible length of the result?

Input

The only line contains one string s (1 ≤ |s| ≤ 500000). It consists of lowercase Latin letters and characters [, ], : and |.

Output

If it is not possible to obtain an accordion by removing some characters from s, print -1. Otherwise print maximum possible length of the resulting accordion.

Examples

Input


|[a:b:|]


Output


4


Input


|]:[|:]


Output


-1

Solution (in JAVA):

Solution:


import java.io.*;
import java.util.*;

public class Q2 {

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public char nextChar() {
            return next().charAt(0);
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public int[] nextIntArr(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextInt();
            }
            return arr;
        }

        public Integer[] nextIntegerArr(int n) {
            Integer[] arr = new Integer[n];
            for (int i = 0; i < n; i++)
                arr[i] = new Integer(this.nextInt());

            return arr;
        }

        public int[][] next2DIntArr(int n, int m) {
            int[][] arr = new int[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    arr[i][j] = this.nextInt();
                }
            }
            return arr;
        }

        public int[] nextSortedIntArr(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextInt();
            }
            Arrays.sort(arr);
            return arr;
        }

        public long[] nextLongArr(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextLong();
            }
            return arr;
        }

        public char[] nextCharArr(int n) {
            char[] arr = new char[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextChar();
            }
            return arr;
        }


        public static int gcd(int a, int b) {
            return b == 0 ? a : gcd(b, a % b);
        }

        public static int[] uwiSieve(int n) {
            if (n <= 32) {
                int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
                for (int i = 0; i < primes.length; i++) {
                    if (n < primes[i]) {
                        return Arrays.copyOf(primes, i);
                    }
                }
                return primes;
            }

            int u = n + 32;
            double lu = Math.log(u);
            int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
            ret[0] = 2;
            int pos = 1;

            int[] isp = new int[(n + 1) / 32 / 2 + 1];
            int sup = (n + 1) / 32 / 2 + 1;

            int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
            for (int tp : tprimes) {
                ret[pos++] = tp;
                int[] ptn = new int[tp];
                for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
                    ptn[i >> 5] |= 1 << (i & 31);
                for (int i = 0; i < tp; i++) {
                    for (int j = i; j < sup; j += tp)
                        isp[j] |= ptn[i];
                }
            }

            // 3,5,7
            // 2x+3=n
            int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,
                    9, 6, 16, 5, 15, 14 };
            int h = n / 2;
            for (int i = 0; i < sup; i++) {
                for (int j = ~isp[i]; j != 0; j &= j - 1) {
                    int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
                    int p = 2 * pp + 3;
                    if (p > n)
                        break;
                    ret[pos++] = p;
                    for (int q = pp; q <= h; q += p)
                        isp[q >> 5] |= 1 << (q & 31);
                }
            }

            return Arrays.copyOf(ret, pos);
        }

        public static int[] radixSort(int[] f){ return radixSort(f, f.length); }

        public static int[] radixSort(int[] f, int n) {
            int[] to = new int[n];
            {
                int[] b = new int[65537];
                for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            {
                int[] b = new int[65537];
                for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            return f;
        }
    }

    public static void main(String[] args) {

        InputReader in = new InputReader();
        String N = in.next();

        StringBuilder strnew=new StringBuilder();

        for (int i = 0; i < N.length(); i++) {
            char ch=N.charAt(i);
           if( ch=='['|| ch==']'|| ch==':' || ch=='|'){
               strnew.append(ch);
           }
        }

        StringBuilder Final=new StringBuilder();
        int flag=0;

        int i;
        for( i=0;i<strnew.length();i++) {
            char ch = strnew.charAt(i);

            if (flag == 0 && ch == '[') {
                flag = 1;
                Final.append(ch);
                continue;
            }

            if (flag == 1 && ch == ':') {
                Final.append(ch);
                flag = 2;
                break;
            }

        }
        if(flag!=2){
            System.out.println(-1);
            return;
        }

        int j=strnew.length()-1,flag1=2;

        for( ;j>i;j--) {

            char ch = strnew.charAt(j);

            if (flag1 == 2 && ch == ']') {
                Final.append(ch);
                flag1 = 3;
                continue;
            }

            if (flag1 == 3 && ch == ':') {
                Final.append(ch);
                flag1 = 4;
                break;
            }
        }

        if(flag1!=4 || i>=j){
            System.out.println(-1);
            return;
        }


        for(;i<j;i++){
            char ch = strnew.charAt(i);
            if ( ch == '|') {
                Final.append(ch);

            }
        }






        System.out.println(Final.length());
        //System.out.println(FinalAns);


    }


}



// for(Map.Entry<Integer,Integer> Test: map.entrySet()){
//            int Key=Test.getKey();
//            int val=Test.getValue();
//        }


//        HashMap<Integer,Integer> map=new HashMap<>();
//        for(int i=0;i<;i++){
//             ch=input[i];
//        if(map.containsKey(ch))
//            map.put(ch,map.get(ch)+1);
//        else
//            map.put(ch,1);
//        }
//
//