What greatest number of elements can be selected from the set of numbers $1, 2, . . . , 1963$ so that the sum of any two of the selected numbers is divisible by 26? 

Let's think step by step and output the final answer within \boxed{}.
user