Take b = 2.

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

367 is prime. b^((n-1)/367)-1 mod n = 103183, which is a unit, inverse 109881.

(367) divides n-1.

(367)^2 > n.

n is prime by Pocklington's theorem.