def has_two_consecutive_odds(n):
  def odd(d):
    return d % 2 == 1

  def even(d):
    return d % 2 == 0

  for (o1,o2,e1,e2,e3) in [(0,1,2,3,4), (1,2,0,3,4), (2,3,0,1,4), (3,4,0,1,2)]:
    if odd(n[o1]) and odd(n[o2]) and even(n[e1]) and even(n[e2]) and even(n[e3]):
      return True
  return False

def counting():
  digits = {0,1,2,3,4,5,6}
  numbers = [-1,-1,-1,-1,-1]
  visited = {
    0: False, 1: False, 2: False,
    3: False, 4: False, 5: False,
    6: False
  }
  count = [0]
  
  def backtrack(i):
    def has_five_digits():
      return numbers[0] != 0

    def is_even():
      return numbers[4] % 2 == 0
  
    for d in digits:
      if not visited[d]:
        visited[d] = True
        numbers[i] = d
        if i == 4:
          if has_five_digits() and is_even() and has_two_consecutive_odds(numbers):
            count[0] += 1
        else:
          backtrack(i+1)
        visited[d] = False

  backtrack(0)
  return count[0]

if __name__ == '__main__':
  print(counting())