**PROBLEM LINK-:** CLICK HERE

**PROBLEM SETTERS-:** @aliencoder_07 @dcpandey

**EDITORIALIST-:** @dcpandey

**DIFFICULTY-:** Easy

**PREREQUISITES-:** Simple observation,Modular

**PROBLEM-:** Binod is giving chocolates to his three daughters.He has two chocolates boxes.One contains A chocolates, and the other contains B chocolates. He can thus give A chocolates, B chocolates or A+B chocolates to his daughters (He cannot open the boxes).

**EXPLANATION-:** Check if any of A, B, or A + B is divisible by 3. The answer is Impossible only for A ≡ B ≡ 1 mod 3 or A ≡ B ≡ 2 mod 3.

**SOLUTION-:** CLICK HERE