The answer is $n \geqslant 4$. Consider the following set of special triples $$\left(0, \frac{8}{15}, \frac{7}{15}\right), \quad\left(\frac{2}{5}, 0, \frac{3}{5}\right), \quad\left(\frac{3}{5}, \frac{2}{5}, 0\right), \quad\left(\frac{2}{15}, \frac{11}{15}, \frac{2}{15}\right)$$ We will prove that any special triple $(x, y, z)$ is worse than one of these (triple $a$ is worse than triple $b$ if triple $b$ is better than triple $a$ ). We suppose that some special triple $(x, y, z)$ is actually not worse than the first three of the triples from the given set, derive some conditions on $x, y, z$ and prove that, under these conditions, $(x, y, z)$ is worse than the fourth triple from the set. Triple $(x, y, z)$ is not worse than $\left(0, \frac{8}{15}, \frac{7}{15}\right)$ means that $y \geqslant \frac{8}{15}$ or $z \geqslant \frac{7}{15}$. Triple $(x, y, z)$ is not worse than $\left(\frac{2}{5}, 0, \frac{3}{5}\right)-x \geqslant \frac{2}{5}$ or $z \geqslant \frac{3}{5}$. Triple $(x, y, z)$ is not worse than $\left(\frac{3}{5}, \frac{2}{5}, 0\right)-x \geqslant \frac{3}{5}$ or $y \geqslant \frac{2}{5}$. Since $x+y+z=1$, then it is impossible that all inequalities $x \geqslant \frac{2}{5}, y \geqslant \frac{2}{5}$ and $z \geqslant \frac{7}{15}$ are true. Suppose that $x<\frac{2}{5}$, then $y \geqslant \frac{2}{5}$ and $z \geqslant \frac{3}{5}$. Using $x+y+z=1$ and $x \geqslant 0$ we get $x=0, y=\frac{2}{5}, z=\frac{3}{5}$. We obtain the triple $\left(0, \frac{2}{5}, \frac{3}{5}\right)$ which is worse than $\left(\frac{2}{15}, \frac{11}{15}, \frac{2}{15}\right)$. Suppose that $y<\frac{2}{5}$, then $x \geqslant \frac{3}{5}$ and $z \geqslant \frac{7}{15}$ and this is a contradiction to the admissibility of $(x, y, z)$. Suppose that $z<\frac{7}{15}$, then $x \geqslant \frac{2}{5}$ and $y \geqslant \frac{8}{15}$. We get (by admissibility, again) that $z \leqslant \frac{1}{15}$ and $y \leqslant \frac{3}{5}$. The last inequalities imply that $\left(\frac{2}{15}, \frac{11}{15}, \frac{2}{15}\right)$ is better than $(x, y, z)$. We will prove that for any given set of three special triples one can find a special triple which is not worse than any triple from the set. Suppose we have a set $S$ of three special triples $$\left(x_{1}, y_{1}, z_{1}\right), \quad\left(x_{2}, y_{2}, z_{2}\right), \quad\left(x_{3}, y_{3}, z_{3}\right)$$ Denote $a(S)=\min \left(x_{1}, x_{2}, x_{3}\right), b(S)=\min \left(y_{1}, y_{2}, y_{3}\right), c(S)=\min \left(z_{1}, z_{2}, z_{3}\right)$. It is easy to check that $S_{1}$ : $$\begin{aligned} & \left(\frac{x_{1}-a}{1-a-b-c}, \frac{y_{1}-b}{1-a-b-c}, \frac{z_{1}-c}{1-a-b-c}\right) \\ & \left(\frac{x_{2}-a}{1-a-b-c}, \frac{y_{2}-b}{1-a-b-c}, \frac{z_{2}-c}{1-a-b-c}\right) \\ & \left(\frac{x_{3}-a}{1-a-b-c}, \frac{y_{3}-b}{1-a-b-c}, \frac{z_{3}-c}{1-a-b-c}\right) \end{aligned}$$ is a set of three special triples also (we may suppose that $a+b+c<1$, because otherwise all three triples are equal and our statement is trivial). If there is a special triple $(x, y, z)$ which is not worse than any triple from $S_{1}$, then the triple $$((1-a-b-c) x+a,(1-a-b-c) y+b,(1-a-b-c) z+c)$$ is special and not worse than any triple from $S$. We also have $a\left(S_{1}\right)=b\left(S_{1}\right)=c\left(S_{1}\right)=0$, so we may suppose that the same holds for our starting set $S$. Suppose that one element of $S$ has two entries equal to 0. Note that one of the two remaining triples from $S$ is not worse than the other. This triple is also not worse than all triples from $S$ because any special triple is not worse than itself and the triple with two zeroes. So we have $a=b=c=0$ but we may suppose that all triples from $S$ contain at most one zero. By transposing triples and elements in triples (elements in all triples must be transposed simultaneously) we may achieve the following situation $x_{1}=y_{2}=z_{3}=0$ and $x_{2} \geqslant x_{3}$. If $z_{2} \geqslant z_{1}$, then the second triple $\left(x_{2}, 0, z_{2}\right)$ is not worse than the other two triples from $S$. So we may assume that $z_{1} \geqslant z_{2}$. If $y_{1} \geqslant y_{3}$ then the first triple is not worse than the second and the third and we assume $y_{3} \geqslant y_{1}$. Consider the three pairs of numbers $x_{2}, y_{1} ; z_{1}, x_{3} ; y_{3}, z_{2}$. The sum of all these numbers is three and consequently the sum of the numbers in one of the pairs is less than or equal to one. If it is the first pair then the triple $\left(x_{2}, 1-x_{2}, 0\right)$ is not worse than all triples from $S$, for the second we may take $\left(1-z_{1}, 0, z_{1}\right)$ and for the third $-\left(0, y_{3}, 1-y_{3}\right)$. So we found a desirable special triple for any given $S$.