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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        BAccordion solver = new BAccordion();
        solver.solve(1, in, out);
        out.close();
    }

    static class BAccordion {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            String s = in.next();

            int n = s.length();

            int[] li = new int[n];

//        if (s.charAt(n - 1) == '|') {
//            li[n - 1] = n - 1;
//        } else li[n - 1] = -1;
//        for (int i = n - 2; i >= 0; i--) {
//            if (s.charAt(i) != '|') {
//                li[i] = -1;
//                continue;
//            }
//            if (s.charAt(i + 1) == '|') {
//                li[i] = li[i + 1];
//            } else {
//                li[i] = i;
//            }
//        }
//
//        int ans = -1;
//        for (int i = 0; i < n - 3; i++) {
//            if (s.charAt(i) == '[' && s.charAt(i + 1) == ':') {
//                if (s.charAt(i + 2) == ':' && s.charAt(i + 3) == ']') {
//                    ans = Math.max(ans, 4);
//                } else if (li[i + 2] != -1) {
//                    int val = li[i + 2];
//
//                    if (val < n - 2 && s.charAt(val + 1) == ':' && s.charAt(val + 2) == ']') {
//                        ans = Math.max(ans, val - i + 1 + 2);
//                    }
//                }
//            }
//        }
//
//        out.println(ans);

            int fli = -1;
            int bfi = -1;


            for (int i = 0; i < n; i++) {
                if (s.charAt(i) == '[') {
                    fli = i;
                    break;
                }
            }

            if (fli == -1) {
                out.println(-1);
                return;
            }
            for (int j = fli + 1; j < n; j++) {
                if (s.charAt(j) == ':') {
                    fli = j;
                    break;
                }
            }

            if (s.charAt(fli) != ':') {
                out.println(-1);
                return;
            }

            s = new StringBuilder(s).reverse().toString();

            for (int i = 0; i < n; i++) {
                if (s.charAt(i) == ']') {
                    bfi = i;
                    break;
                }
            }

            if (bfi == -1) {
                out.println(-1);
                return;
            }
            for (int j = bfi + 1; j < n; j++) {
                if (s.charAt(j) == ':') {
                    bfi = j;
                    break;
                }
            }

            if (s.charAt(bfi) != ':') {
                out.println(-1);
                return;
            }

            fli = n - 1 - fli;

            if (fli == -1 || bfi == -1 || bfi >= fli) {
                out.println(-1);
                return;
            }

            int ans = 4;
            for (int i = bfi; i < fli; i++) {
                if (s.charAt(i) == '|')
                    ans++;
            }

            out.println(ans);
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public String nextString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c)) {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public String next() {
            return nextString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}