Java program to find XOR of all Prime numbers in an Array at positions divisible by K
class GFG { static int MAX = 1000005 ; static boolean prime [ ] = new boolean [ MAX ] ; static void SieveOfEratosthenes ( boolean [ ] prime ) {