So there's a figure which contains n squares of 1 x 1, and I have to find the smallest circumference possible. I don't know if there's an algorithm behind this, I've been stuck on this for two hours but can't figure a working algorithm.

I do know that the smallest circumference of four squares is 8, of 11 is 14 and 200 is 58. If anyone could give me a hint on where to begin, I'd greatly appreciate it.