Let F
n be a binary form with integral coefficients of degree n2, let d denote the greatest common divisor of all non-zero coefficients of F
n, and let h2 be an integer. We prove that if d=1 then the Thue equation (T) F
n(x,y)=h has relatively few solutions: if is a subset of the set of all solutions to (T), with , then
(#) h divides the number , where , 1kr, and δ(ξk,ξl)=xkyl−xlyk. As a corollary we obtain that if h is a prime number then, under weak assumptions on Fn, there is a partition of into at most n subsets maximal with respect to condition (#).