In RSA encryption, a message $m$ encrypted using a public key $(n,e)$ and decrypted by private key $d$, according to following relation (where $c$ is encrypted data);
$c = m ^ e (\mod n)$
$m = c^d (\mod n)$
Am I correct to think that encrypted value can have $n$ distinct values (because of $(\mod n)$), and therefore, only $n$ different messages can be encrypted/decrypted without loss of information?