Eulerian and Hamiltonian Graphs · Easy problem

In $K_{3,3}$ ($6$ vertices), take two vertices $u,v$ from the same side, so they are not adjacent. Ore's theorem asks whether $\deg(u)+\deg(v)\ge n$. What is $\deg(u)+\deg(v)$?