Extremal Graph Theory and Ramsey Theory · Hard problem

What is the largest $n$ such that $\{1,\dots,n\}$ can be colored red and blue with no monochromatic solution of $x+y=z$ ($x=y$ allowed)?