Given an integer \$n\$. Connect all pairs of points on \$\mathbb Z^2\$ whose distance is \$\sqrt n\$. Count how many connected sets remain.
In case that infinite sets exist, return something not a positive integer. (0 used below)
Test cases
1 => 1
2 => 2
3 => 0
4 => 4
5 => 1
25 => 1
0
Inspired by the feature in Pikmin 4.
In Pikmin 4, you can have up to eight types of pikmin in an onion and up to three types of pikmin outside the onion. Each area recommends three types of pikmin to bring. The onion's interface has an "auto" button which selects pikmin in the following fashion:
...
