Xor Xor se Chillao

CodeChefOpen on judge ↗

In BITS, there is a tradition of saying "Lite" on a particular condition. The condition is that you should be able to divide the elements of the given array into two **non-empty** sets such that every element of the given array belongs to exactly one of the sets and XOR of elements of first set is same as XOR of elements of second set. You have to print in a single line "Lite" if you can fulfil

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI