Question

Ritik loves to jump here and there.so s friend sugam gave m an array of n integers in wch he can choose any pair of integers ai and aj if and only if i+k=j. now he can add 1 to one of those elements and subtract one from the other i.e move 1 from one element to the other.he can perform ts operation any number of times by jumping here and there in the array.now ritik wants to know if he can make all the numbers prime by jumping and performing 0 or more number of given operations on the array.

Answer 1

it is very simple but time consuming