There are N heaps of sweets (numbered 1 through N); for each valid i, the i-th of them contains exactly ik sweets. You aim to partition these heaps between you and your friend in such a way that each...

Extracted text: There are N heaps of sweets (numbered 1 through N); for each valid i, the i-th of them contains exactly ik sweets. You aim to partition these heaps between you and your friend in such a way that each heap is given to exactly one of you without being split among you. The distribution should be as fair as possible. Formally, let's denote the total number of sweets you get by A and the total number of sweets your friend gets by B; your goal is to minimise JA-BJ. Develop a python code to find the smallest possible value of JA-BJ. Sample Input: 2 1 4 Sample Output: 2 0001