What is the worst case Big O time complexity of the following pseudocode?

repeat (^2)times {

for (i=1; i<=n; i++) {

doSomething() // O(1)

}

for (j=1; 2()

for (p=n; p>=1; p = p/2) {

doSomething() // O(1)

}

}

}