
def 				UpperCAmelCase_						(				__SCREAMING_SNAKE_CASE = 50				):
	lowercase	    =       [[0] * 3 for _ in range(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				):
				different_colour_ways_number[row_length][tile_length - 2] += (
				    different_colour_ways_number[row_length - tile_start - tile_length][
				        tile_length - 2
				    ]
				    + 1
				)

	return sum(different_colour_ways_number[length]				)


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









'''simple docstring'''







from math import isqrt, loga


def       __UpperCamelCase					(      lowercase_       :  int   ):
       """simple docstring"""




       a_						     =			[True] * max_number
       for i in range(2   ,       isqrt(max_number - 1   ) + 1   ):
              if is_prime[i]:
                     for j in range(i**2   ,       lowercase_   ,       lowercase_   ):
                            a_						     =			False

       return [i for i in range(2   ,       lowercase_   ) if is_prime[i]]


def       __UpperCamelCase					(      lowercase_       :  int = 800_800   ,       lowercase_       :  int = 800_800   ):
       """simple docstring"""




       a_						     =			degree * loga(lowercase_   )
       a_						     =			int(lowercase_   )
       a_						     =			calculate_prime_numbers(lowercase_   )

       a_						     =			0
       a_						     =			0
       a_						     =			len(lowercase_   ) - 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() = }""")




