Find all ordered tuples of positive integers $(a_1,a_2,a_3,\ldots,a_n)$ such that $\frac{1}{a_1}+\frac{2}{a_2}+\frac{3}{a_3}+\cdots+\frac{n}{a_n}=\frac{a_1+a_2+a_3+\cdots+a_n}{2}$
The only thing I have been able to think about is using inequalities. I have tried to apply AM-GM, Titu's lemma etc.. Cauchy-Schwarz gives the following thing:
$$(\frac{1}{a_1}+\frac{2}{a_2}+\frac{3}{a_3}+\cdots+\frac{n}{a_n})(a_1+\cdots a_n) \ge (\sqrt{1}+\sqrt{2}+\cdots \sqrt{n})^2$$
$$(a_1+\cdots a_n)^2\ge 2(\sqrt{1}+\cdots \sqrt {n})^2$$
which doesn't really help us at all.
I have also tried considering smaller cases. For $n=2$,
$$a_1a_2(a_1+a_2)=4a_1+2a_2$$ which tells us that $2a_2=ka_1$ and $8a_1=pa_2=ka_1p\implies kp=8$. This should now give us all the solutions by checking all the cases.
So how can we even begin to attack this problem?