III

III

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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.

Sample Input

Input

[<}){}

Output

2

Input

{()}[]

Output

0

Input

]]

Output

Impossible

---

括号匹配的问题我们让他遇到左括号就进栈遇到右括号判断栈是否为空如果空就不可能匹配不为空就判断是否可以相等不相等就加一然后出栈

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

#include<cstdio>
#include<stack>
using namespace std;
char str[1000011];
int main(){
	scanf("%s",str);
	int i=0;
	stack<char>cnt;
	int cns=0;
	bool k=true;
	while(str[i]){
		if(str[i]=='['||str[i]=='('||str[i]=='{'||str[i]=='<'){
			cnt.push(str[i]);
		}
		if(str[i]==']'||str[i]==')'||str[i]=='}'||str[i]=='>'){
			if(cnt.empty()){
				k=false;
				break;
			}
			else{
				if( !( (str[i]==']'&&cnt.top()=='[') || (str[i]=='}'&&cnt.top()=='{')||(str[i]==')'&&cnt.top()=='(')||(str[i]=='>'&&cnt.top()=='<') ) )   
					cns++;
				cnt.pop();
			}
		}
		i++;
	}
	if(cnt.empty()&&k)
		printf("%d\n",cns);
	else
		printf("Impossible\n");
	return 0;
}