A

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

这道题很明显要用到栈的知识，内容大意就是最少要修改几次才能得到括号的匹配的正确结果。和普通的括号匹配一样，碰到左括号就进栈，遇到右括号出栈比较是否匹配，不匹配就需要对左括号进行修改。当遇到有右括号但栈为空，或者没有右括号了但栈还有剩余就输出Impossible

对应的ac代码：

#include<iostream>
#include<string.h>
#include<stack>
using namespace std;
char s[1000000];
int main()
{
stack<char>a;
scanf("%s", s);
int flag = 1;
int count = 0;
int l = strlen(s);
for (int i = 0; i<l; i++)
{
if (s[i] == '(' || s[i] == '{' || s[i] == '[' || s[i] == '<')
a.push(s[i]);
else if (s[i] == ')' || s[i] == '}' || s[i] == ']' || s[i] == '>')
{
if (a.empty())
{
flag = 0;
break;
}
else
{
if (a.top() == '('&&s[i] == ')' || a.top() == '{'&&s[i] == '}' || a.top() == '['&&s[i] == ']' || a.top() == '<'&&s[i] == '>')
count = count;
else
count++;
}
a.pop();


}

if (!a.empty())
flag = 0;
if (flag == 1)
printf("%d\n", count);
else
printf("Impossible\n");


return 0;
}