In 2016, I proposed a problem about trying to take three rectangles and seeing if it was possible to combine them to form a square. It got accepted. Please implement this function instead.

`bool f(int n)`

You may assume .

In 2016, I proposed a problem about trying to take three rectangles and seeing if it was possible to combine them to form a square. It got accepted. Please implement this function instead.

`bool f(int n)`

You may assume .

## Comments

Any tips on how to not TLE. I think my solution has a O(n + sqrt(n)) time complexity, which should be well under the time limit.

Hint: Aim for . (Solution)