

def  UpperCAmelCase__      ( UpperCAmelCase__ = 50			)     ->     List[Any]:
       A_		   = [[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'''







def  UpperCAmelCase__      ( UpperCAmelCase__ = 1_00			)     ->     int:
       A_		   = n * (n + 1) * (2 * n + 1) / 6
       A_		   = (n * (n + 1) / 2) ** 2
       return int(square_of_sum - sum_of_squares			)


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