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:
//package com.company;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        StringBuilder sb = new StringBuilder();
        Scanner s=new Scanner(System.in);

  char[] a=s.next().toCharArray();
  int flag=0;int st=-1;int end=-1;
  for(int i=0;i<a.length;i++){
      if(a[i]=='['&&flag==0){
          flag=1;continue;
      }else if(flag==1&&a[i]==':'){
          st=i;break;
      }
  }flag=0;
  for(int i=a.length-1;i>=0;i--){
      if(a[i]==']'&&flag==0){
          flag=1;continue;
      }else if(flag==1&&a[i]==':'){
          if(i>st&&st!=-1){
              end=i;break;
          }
      }
        }if(st!=-1&&end!=-1){int l=0;
      for(int i=st+1;i<end;i++){
          if(a[i]=='|') l++;
      }
            System.out.println(l+4);
        }else{
            System.out.println(-1);
        }
    }static int success=0,endi=0,endj=0;static char[][] a;static int n,m;static int[] [] vis;
static void dfs(int i,int j,char dir,int turns){
   //  vis[i][j]=1;
     if(turns>2) return;

       if(dir=='Z'){
           if(i+1<n&&a[i+1][j]=='T') {
              success=1;return;
           }if(success==1) return;
               if(i+1<n&&a[i+1][j]!='*'&&vis[i+1][j]==0){
               dfs(i+1,j,'D',turns);
           }if(success==1) return;if(i-1>=0&&a[i-1][j]=='T') {
               success=1;return;
           }if(success==1) return;
           if(i-1>=0&&a[i-1][j]!='*'&&vis[i-1][j]==0){
               dfs(i-1,j,'U',turns);
           }if(success==1) return;
           if(j+1<m&&a[i][j+1]=='T') {
               success=1;return;
           }if(success==1) return;
           if(j+1<m&&a[i][j+1]!='*'&&vis[i][j+1]==0){
               dfs(i,j+1,'R',turns);
           }if(success==1) return;
           if(j-1>=0&&a[i][j-1]=='T') {
               success=1;
           }if(success==1) return;
           if(j-1>=0&&a[i][j-1]!='*'){
               dfs(i,j-1,'L',turns);
           }if(success==1) return;
       }else{
           if(i+1<n&&a[i+1][j]=='T') {
               if(turns<2||'D'==dir)
                   success=1;
           }if(success==1) return;
           if(i+1<n&&a[i+1][j]!='*'&&vis[i+1][j]==0){
         if('D'!=dir)       dfs(i+1,j,'D',turns+1);else      dfs(i+1,j,'D',turns);

           }if(success==1) return;
           if(i-1>=0&&a[i-1][j]=='T') {
               if(turns<2||'U'==dir)

                   success=1;;
           }if(success==1) return;
           if(i-1>=0&&a[i-1][j]!='*'&&vis[i-1][j]==0){
             if('U'!=dir)
               dfs(i-1,j,'U',turns+1);else      dfs(i-1,j,'U',turns);

           }if(success==1) return;
           if(j+1<m&&a[i][j+1]=='T') {
               if(turns<2||'R'==dir)

                   success=1;;
           }if(success==1) return;
           if(j+1<m&&a[i][j+1]!='*'&&vis[i][j+1]==0){
              if('R'!=dir)
               dfs(i,j+1,'R',turns+1);
              else
                  dfs(i,j+1,'R',turns);

           }if(success==1) return;
           if(j-1>=0&&a[i][j-1]=='T') {
               if(turns<2||'L'==dir)
               success=1;

           }if(success==1) return;
           if(j-1>=0&&a[i][j-1]!='*'&&vis[i][j-1]==0){
               if('L'!=dir)
               dfs(i,j-1,'L',turns+1);
               else
                   dfs(i,j-1,'L',turns);

           }if(success==1) return;
       }
}

}