Find numbers with exactly two sum-of-squares forms

Given an integer \(n\), find all integers \(s\) such that \(0 \le s < n\) and \(s\) can be expressed as a sum of two squares in **exactly two distinct unordered ways**: \[ s = a^2 + b^2 \] where \(a\) and \(b\) are **non-negative integers**, and \((a,b)\) and \((b,a)\) are considered the **same** representation (i.e., order does not matter). Return all such \(s\) (in any order, unless otherwise specified). ### Example - For \(n > 50\), \(50\) qualifies because: - \(50 = 1^2 + 7^2\) - \(50 = 5^2 + 5^2\) and there are exactly two unordered representations. ### Constraints - \(1 \le n < 2^{31}-1\) ### Notes - Representations must use **non-negative** integers. - Count unordered pairs: enforce \(a \le b\) to avoid double-counting.