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
# optimize input/output
import sys
input = sys.stdin.readline
# print = sys.stdout.write

S = input().split('\n')[0]

def open_close(c):
    if c in "[{<(":
        return 1
    return -1

def number(c):
    if "[{<(".find(c) != -1:
        return "[{<(".find(c)
    return "]}>)".find(c)

stack = []

sol = 0
for c in S:
    if(open_close(c) == 1):
        stack.append(number(c))
    else:
        if(len(stack) == 0):
            print("Impossible")
            sys.exit(0)

        if(stack.pop() != number(c)):
            sol += 1

print(sol)

# def number(c):
#     if "[{<(".find(c) != -1:
#         return "[{<(".find(c)
#     return "]}>)".find(c)

# cont = 0
# for c in S:
#     cont += open_close(c)
#     if cont < 0:
#         print("Impossible")
#         sys.exit(0)

# cont = [0,0,0,0]
# mn = [0,0,0,0]

# for c in S:
#     cont[number(c)] += open_close(c)

#     mn[number(c)] = min([mn[number(c)],cont[number(c)]])

# print(-sum(mn))