What greatest number of integers can be selected from the set $1, 2, . . . , 1963$ so that no sum of any two selected numbers were divisible by their difference? 

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