def funfun(n):
  if n == 0:
    return 0
  else:
    recursivepart = funfun(n - 1)
    return n + recursivepart

def fun2(n):
  if n == 0:
    return 0
  else:
    number = int(input())
    recursivepart = fun2(n - 1)
    return number + recursivepart

def pocetparnych(n):
  if n == 0:
    return 0
  else:
    number = int(input())
    pocet = 0
    if number%2 == 0:
      pocet = 1
    recursivepart = pocetparnych(n - 1)
    return pocet + recursivepart

def maximum(n):
  if n == 0:
    return 0
  else:
    number = int(input())
    recursivepart = maximum(n - 1)
    if number > recursivepart:
      return number
    else:
      return recursivepart

def cv5(n):
  if n == 0:
    return True
  else:
    number = int(input())
    recursivepart = cv5(n - 1)
    if (number % 2 == 0 and recursivepart) or (number % 2 == 1 and not recursivepart):
      return True
    else:
      return False

#x = funfun(5)
#print(x)

#x = fun2(5)
#print(x)

#x = pocetparnych(5)
#print(x)

#x = maximum(5)
#print(x)

x = cv5(5)
print(x)