Start with three numbers $1,1,1$, each operation replaces one of the numbers with the sum of the other two. After 10 operations, what is the maximum possible value of the largest number among the three obtained?