What is the Big$-$O of the number of multiplications in the following snippet of code $?$

void mystery$($ int n $)$

$\{$

int x $=1,$ y $=3$;

x $=$ x $+2*$ y;

for$($int j $=1$; j $<$ n; j$++)$

$\{$

x $=$ x $*$ y;

$\}$

for$($int i $=0$; i $<$ n; i$++)$

$\{$

if$($ x $>5)$

y $=$ x $*$ y;

else

y $=$ x $*2$;

$\}$

$\}$