Take b = 2.

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

6367 is prime. b^((n-1)/6367)-1 mod n = 121034, which is a unit, inverse 142657.

(6367) divides n-1.

(6367)^2 > n.

n is prime by Pocklington's theorem.