Take b = 2.

b^(n-1) mod n = 1.

359 is prime. b^((n-1)/359)-1 mod n = 55998, which is a unit, inverse 32269.

(359) divides n-1.

(359)^2 > n.

n is prime by Pocklington's theorem.