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.*;
import java.math.*;
import java.util.regex.*;
public class srx
{
	static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[10000000]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        }
	
	public String readWord() throws IOException 
        { 
            byte[] buf = new byte[10000000]; // word length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n' || c==' ') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
		
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    }
	/*static class obj
	{
		int ind;
		int val;
		public obj(int a,int b)
		{
			ind=a;
			val=b;
		}
	}*/
	/*static class objcomparator implements Comparator<obj>
	{
		public int compare(obj s1, obj s2)
		{
			if(s1.val<s2.val)
				return 1;
			else if(s1.val>s2.val)
				return -1;
				return 1;
		}
	}*/
	static boolean isPrime(long n) 
    	{  
        	if (n <= 1) return false; 
       		if (n <= 3) return true; 
      
	        if (n % 2 == 0 || n % 3 == 0) return false; 
      
     		   for (int i = 5; i * i <= n; i = i + 6) 
     		       if (n % i == 0 || n % (i + 2) == 0) 
     			       return false; 
      
        	return true; 
    	}
	public static long gfg(long a,long b)
	{
		if(b==0)
			return a;
		else
			return gfg(b,a%b);
	}
	static long maxi(long n) 
    { 
        long maxPrime = -1; 
        while (n % 2 == 0) { 
            maxPrime = 2; 
            n >>= 1; 
        } 
        for (int i = 3; i <= Math.sqrt(n); i += 2) { 
            while (n % i == 0) { 
                maxPrime = i; 
                n = n / i; 
            } 
        } 
        if (n > 2) 
            maxPrime = n; 
  
        return maxPrime; 
    } 
	static boolean isPrime(int n) 
    {  
        if (n <= 1) return false; 
        if (n <= 3) return true; 
        if (n % 2 == 0 || n % 3 == 0) return false; 
      
        for (int i = 5; i * i <= n; i = i + 6) 
            if (n % i == 0 || n % (i + 2) == 0) 
            return false; 
      
        return true; 
    } 
	public static void main (String[] args) throws IOException
	{
		Reader sc=new Reader();
		String s=sc.readLine();
		char c[]=s.toCharArray();
		int n=c.length;
		int a,b,x,y=0;
		int i=0;
		int j=c.length-1;
		while(i<n && c[i++]!='[');
			a=i-1;
		while(i<n && c[i++]!=':');
			b=i-1;
		while(j>=0 && c[j--]!=']');
			y=j+1;
		while(j>=0 && c[j--]!=':');
			x=j+1;
		//System.out.println(a+" "+b+" "+x+" "+y);
		if(b<x && b<y && a<y && a<x && a<b && x<y)
		{
			int count=0;
			for(i=b;i<=x;i++)
				if(c[i]=='|')
					count+=1;
			System.out.println(count+4);
		}
		else
			System.out.println("-1");		
	}
}