MathNet 2013 Question 54

Let $n\ge1$ be an integer. From $\{1,2,\dots,n\}$, what is the greatest number of pairs that can be chosen so that each pair contains two distinct numbers, the sums of different pairs are distinct, and each sum is at most $n$?