Pairwise Digit Sums I

Find the largest value of $n$ such that the there exists a $n$ digit number with all unique pairwise sums of digits. For example, if $n = 3$, $174$ is a valid integer, since $1+7 \neq 1+4 \neq 7 + 4$.