Is minimum colors needed to assign colors to edges of complete graph $K_n$ so that every even simple cycle contains an odd number ($>1$) of colors much larger than $(\log n)^\beta$ or $n^{\frac{1}\beta}$ with some fixed $\beta>1$?

What is a good upper bound?