Why the sentence $(\exists x, y)(\neg x\equiv y)$ has at least 2 equivalence classes?

Question

$(\exists x, y)(\neg x\equiv y)$

In this case, I can only come up with the binary numbers $0$ and $1$. If not $0$, then must be $1$. Doesn't it has only 1 equivalence class?