Chinese Remainder Theorem

I have to find the smallest positive integer 'x' which satisfies two simultaneous linear congruence. I used the Chinese remainder theorem and got a single linear congruence class to be x = 139 mod 165 (I've used '=' instead of the congruence sign).

How do I solve this to find the smallest positive integer?

x-139 = 165n. Choose n smallest to find smallest +ve x. Say n = 1, x = 165+139 = 304.