Is there any integer $N$ such that $2^N\equiv 3 \bmod N$? I understand that $N$ must be an odd non-prime. I checked up to a million with no success (but $2^N\equiv 5 \bmod N$ and $2^N\equiv 7 \bmod N$ have solutions).