You are given string *s* consists of opening and closing brackets of four kinds &lt;&gt;, {}, [], (). 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 &lt; by the bracket {, but you can't replace it by ) or &gt;.

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*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub> be a RBS then the strings &lt;*s*<sub class="lower-index">1</sub>&gt;*s*<sub class="lower-index">2</sub>, {*s*<sub class="lower-index">1</sub>}*s*<sub class="lower-index">2</sub>, [*s*<sub class="lower-index">1</sub>]*s*<sub class="lower-index">2</sub>, (*s*<sub class="lower-index">1</sub>)*s*<sub class="lower-index">2</sub> are also RBS.

For example the string "[[(){}]&lt;&gt;]" is RBS, but the strings "[)()" and "][()()" are not.

Determine the least number of replaces to make the string *s* RBS.
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<sup class="upper-index">6</sup>.
none
[<}){}
2
{()}[]
0
]]
Impossible
>
Impossible
{}
0
{}
0
{]
1
{]
1
{]
1
[]{[]({)([
Impossible
(([{>}{[{[)]]>>]
7
((<>)[]<]><]
3
[[([[(>]>)))[<)>
6
({)[}<)](}
5
(}{)[<][)(]}
6
>}({>]{[}<{<{{)[]]{)]>]]]<(][{)<<<{<<)>)()[>{<]]{}<>}}}}(>}<})(][>{((<{<)]}>)))][>[}[])<]){]]][<[)([
Impossible
<<[<{{<([({<<[)<>(]]){})>[](])[)))[[}>]<)>[[>{>>>[<]}<>>)[>]<{)<[><(<]][>(>]>][(<][{]}(()<[()[>><<])<]})]<]}{)
45
[<<{{((}[}<<)<)>})(][{>}})((>)<[)[>}[})[)>()[()[((}<<(>)<>](<>(}[>})[[[{)<}<<(}{>>}[<([[])<><)]<{>}[>>>{({>)}]})>)
42
(<[([(<({>(}{]>[(})])}])()<<}{]{[>]>(>>[(>>}[){(}<[{(()]{{<(<{][[{<><{<{)<>>]}}}{)(}{})}[<))>>}((({>){({}{{]}]>>}})>))
43
{(]}<([]<]{>]<{<({{{<>))}[({(}{)[}({>]}}<<)}<]))(<>(>{>{{{)<}({<]<>{)(>[)>{({}<([<[[)]><>{]}}(>]{}<)[})]}]]}]}>}
40
<(([)]<[}>{)>][[(<()({{{>>((]<}<{{<>}><<[)}[[)([[)[)}<]<{(<>){([)><{[([[][({])})<][(}]}>>[){)[({>){(}[}})>}>]>)]}))})>}]
45
)(
Impossible
[[[[[[[[
Impossible
def isopen(c):
	return (c == '(' or c == '[' or c == '<' or c == '{');

open = dict({'[': 1, '(': 2, '<': 3, '{': 4});
close = dict({']': 1, ')': 2, '>': 3, '}': 4});
str = input();
n = len(str);
op = 0; cl = 0;
flag = 0;
for i in range(n):
	if (isopen(str[i])):
		op += 1;
	else:
		cl += 1;
	if (op < cl):
		flag = 1;
		break;
if (op != cl):
	flag = 1;
if (flag == 1):
	print("Impossible");
else:
	s = [];
	i = 0; ans = 0;
	while (i < n):
		s.append(open[str[i]]);
		i += 1;
		while (s != []):
			temp = s[-1];
			if (isopen(str[i])):
				s.append(open[str[i]]);
			else:
				if (temp != close[str[i]]):
					ans += 1;
				s.pop();
			i += 1;
	print(ans);