IMC 2007 — Keystage 3 (IWYMIC) — team Question 9

Arrange the integers one to $n$, $n\gt 1$, in a line so every adjacent pair sums to a square. What is the minimum $n$?