From a set of 2n+1 consecutive integers a certain number, say x, is selected in a way that the remaining n pairs can be arranged as couples having the same sum.

What are all the possible values of x making such task doable?

(In reply to Not feeling literal by Steve Herman)

I red the puzzle literally. As 2n+1 is always odd, removing one leave always n pairs of numbers. 

Edited on February 14, 2018, 2:20 am

Posted by armando on 2018-02-14 02:15:09