def count_outermost_pairs(s):
    count = 0
    pos = 0
    n = len(s)
    while pos < n:
        if s[pos] == '(':
            level = 1
            i = pos + 1
            while i < n and level > 0:
                if s[i] == '(':
                    level += 1
                else:
                    level -= 1
                i += 1
            count += 1
            pos = i
        else:
            pos += 1
    return count

H = input().strip()
k = count_outermost_pairs(H)
print(0 if k % 2 == 1 else 1)