Missing Sums

Given a positive integer $N$, construct an array $A$ containing $N$ $\textbf{distinct}$ elements such that the sum of any two elements in the array (not necessarily different) is not present in the array. That is, there have to be $\textbf{no}$ such $i, j, k$ such that - $1 \le i, j, k \le N$ - $A_i + A_j = A_k$. The elements of the array $A$ should be in the range $[1, 10^5]$. It is guarante