


"""simple docstring"""






def        lowerCamelCase_(		_lowerCamelCase = 50       )    ->     int:
   '''simple docstring'''





   _lowerCamelCase   :				Any							=     [1] * (length + 1)

   for row_length in range(length + 1       ):
      for tile_length in range(2			,		5       ):
         for tile_start in range(row_length - tile_length + 1       ):
            ways_number[row_length] += ways_number[
                row_length - tile_start - tile_length
            ]

   return ways_number[length]


if __name__ == "__main__":
  print(f'''{solution() = }''')





'''simple docstring'''


from math import isqrt, loga
def 						lowerCamelCase__   (				a							):
						__snake_case						 =   [True] * max_number
						for i in range(2    ,	isqrt(max_number - 1							) + 1							):
												if is_prime[i]:
																		for j in range(i**2    ,	a    ,	a							):
																								__snake_case						 =   False

						return [i for i in range(2    ,	a							) if is_prime[i]]
def 						lowerCamelCase__   (				a = 800800    ,	a = 800800							):
						__snake_case						 =   degree * loga(a							)
						__snake_case						 =   int(a							)
						__snake_case						 =   calculate_prime_numbers(a							)

						__snake_case						 =   0
						__snake_case						 =   0
						__snake_case						 =   len(a							) - 1
						while left < right:
												while (
												    prime_numbers[right] * loga(prime_numbers[left]							)
												    + prime_numbers[left] * loga(prime_numbers[right]							)
												    > upper_bound
												):
																		right -= 1
												hybrid_integers_count += right - left
												left += 1

						return hybrid_integers_count


if __name__ == "__main__":
	print(f'''{solution() = }''')

