Let be an integer (square free, not equal to one)

Prove that if or then is not a UFD.

I know that 2 is not a prime in . I also know that if d is one mod three we can rewrite it as the sum of 2 squares. But I don't know how to come up with explicit d. For I don't have a handy characterization (sum of 2 squares or something like that).