The **continued fraction** of a number `n` is a fraction of the following form:<br><br>
<img src="http://upload.wikimedia.org/wikipedia/en/math/1/1/d/11dc14afeeb64dad18b916638aa287d7.png"></img><br>
which converges to `n`.

The sequence `a` in a continued fraction is typically written as: [a<sub>0</sub>; a<sub>1</sub>, a<sub>2</sub>, a<sub>3</sub>, ... a<sub>n</sub>].<br>
We will write ours in the same fashion, but with the repeating part between semicolons.

Your goal is to return the continued fraction of the square root of `n`.<br>
**Input:** An integer, `n`. `n` will never be a perfect square.<br>
**Output:** The continued fraction of `sqrt(n)`.

**Test Cases:**<br>
`2 -> [1; 2;]`<br>
`3 -> [1; 1, 2;]`<br>
`19 -> [4; 2, 1, 3, 1, 2, 8;]`<br>

Shortest code wins. Good luck!