

import math
from datetime import datetime, timedelta
def   a   (    A__			:     int  )					->   datetime:





      """simple docstring"""



      _lowercase			 =year % 19
      _lowercase			 =year % 4
      _lowercase			 =year % 7
      _lowercase			 =math.floor(year / 100  )
      _lowercase			 =math.floor((13 + 8 * leap_day_inhibits) / 25  )
      _lowercase			 =leap_day_inhibits / 4
      _lowercase			 =(
          15 - lunar_orbit_correction + leap_day_inhibits - leap_day_reinstall_number
      ) % 30
      _lowercase			 =(4 + leap_day_inhibits - leap_day_reinstall_number) % 7

      # days to be added to March 21
      _lowercase			 =(19 * metonic_cycle + secular_moon_shift) % 30

      # PHM -> Paschal Full Moon
      _lowercase			 =(
          2 * julian_leap_year
          + 4 * non_leap_year
          + 6 * days_to_add
          + century_starting_point
      ) % 7

      if days_to_add == 29 and days_from_phm_to_sunday == 6:
            return datetime(A__   ,     4   ,     19  )
      elif days_to_add == 28 and days_from_phm_to_sunday == 6:
            return datetime(A__   ,     4   ,     18  )
      else:
            return datetime(A__   ,     3   ,     22  ) + timedelta(
                days=int(days_to_add + days_from_phm_to_sunday  )  )


if __name__ == "__main__":
  for year in (1_9_9_4, 2_0_0_0, 2_0_1_0, 2_0_2_1, 2_0_2_3):
    lowercase_             =     'will be' if year > datetime.now().year else 'was'
    print(f"Easter in {year} {tense} {gauss_easter(year)}")





def   a   (    A__			:     Optional[int]  )					->   Tuple:





      """simple docstring"""



      _lowercase			 =[0] * len(A__  )
      _lowercase			 =[]
      _lowercase			 =[]
      _lowercase			 =0

      for values in graph.values():
            for i in values:
                  indegree[i] += 1

      for i in range(len(A__  )  ):
            if indegree[i] == 0:
                  queue.append(A__  )

      while queue:
            _lowercase			 =queue.pop(0  )
            cnt += 1
            topo.append(A__  )
            for x in graph[vertex]:
                  indegree[x] -= 1
                  if indegree[x] == 0:
                        queue.append(A__  )

      if cnt != len(A__  ):
            print('Cycle exists'  )
      else:
            print(A__  )


# Adjacency List of Graph
lowercase_             =     {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}







topological_sort(graph)


