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