What is minimum number of colors we need to assign colors to edges of a complete graph $K_n$ so that every even simple cycle contains an odd number (bigger than $1$) of colors?

Is it much larger than $(\log n)^\beta$ with some fixed $\beta>1$?