G - Replace To Make Regular Bracket Sequence

#include<cstdio>     //栈  最后判断是否为空  清出 
#include<cstring>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
char s[1000010];
int main()
{
	while(scanf("%s",s)!=EOF)
	{
		stack<char >sta;
		int l=strlen(s);
		int i,flag=1,c1=0,c2=0,count=0;
		for(i=0;i<l;i++)
		{
			if(s[i]=='('||s[i]=='<'||s[i]=='{'||s[i]=='[')
			{
				sta.push(s[i]); 
				count++;
			}
			else
			{
				c2++;
				if(s[i]==')')
				{
					if(sta.empty() )
					{
						flag=0;break;
					}
				//	sta.pop() ;
					else
					{
						if(sta.top() =='(')
						{
							sta.pop() ;
						}
						else      /chu cuo
						{
							sta.pop() ;
							c1++;
						}
					}
				}
				if(s[i]=='}')
				{
					if(sta.empty() )
					{
						flag=0;break;
					}
					//sta.pop() ;
					else
					{
						if(sta.top() =='{')
						{
							sta.pop() ;
						}
						else
						{
							sta.pop() ;
							c1++;
						}
					}
				}
				if(s[i]=='>')
				{
					if(sta.empty() )
					{
						flag=0;break;
					}
					else
					{
						if(sta.top() =='<')
						{
							sta.pop() ;
						}
						else
						{
							sta.pop() ;
							c1++;
						}
					}
				}
				if(s[i]==']')
				{
					if(sta.empty() )
					{
						flag=0;break;
					}
					else
					{
						if(sta.top() =='[')
						{
							sta.pop() ;
						}
						else
						{
							sta.pop() ;
							c1++;
						}
					}
				}
			}
		}
		if(c2!=count)   
        flag=0;  
    	if(flag==1)  
        printf("%d\n",c1);  
   		 else  
       	printf("Impossible\n"); 
	}
	return 0;
}

You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can't replace it by ) or >.

The following definition of a regular bracket sequence is well-known, so you can be familiar with it.

Let's define a regular bracket sequence (RBS). Empty string is RBS. Let s₁ and s₂ be a RBS then the strings <s₁>s₂, {s₁}s₂, [s₁]s₂, (s₁)s₂ are also RBS.

For example the string "[[(){}]<>]" is RBS, but the strings "[)()" and "][()()" are not.

Determine the least number of replaces to make the string s RBS.

Input

The only line contains a non empty string s, consisting of only opening and closing brackets of four kinds. The length of s does not exceed 10⁶.

Output

If it's impossible to get RBS from s print Impossible.

Otherwise print the least number of replaces needed to get RBS from s.

Example

Input

[<}){}

Output

2

Input

{()}[]

Output

0

Input

]]

Output

Impossible