There are nnn sticks of lengths 1,2,…,n1, 2, \ldots, n1,2,…,n. Is it possible to form a square from these sticks, and if not, what is the minimum number of sticks that need to be broken in half to form a square: a) when n=12n = 12n=12; b) when n=15n = 15n=15?