A cryptography problem:

Let Product_1 = (Enc_1, Dec_1, KeyGen_1, P, C) and Product_2 = (Enc_2, Dec_2, KeyGen_2, P, C) be two encryption schemes with P = {0, 1} for which it is known that at least one is IND-CPA (semantically secure). The problem is that you don't know which one is IND-CPA and which one may not be. Show how to construct an encryption scheme that is IND-CPA secure as long as at least one of the scheme is IND-CPA secure