find the run time complexity of the pop and push function from this code

#include

#include

class Stack {

private:

std::queue q1;

std::queue q2;

public:

void push(int x) {

q1.push(x);

}

int pop() {

if (q1.empty()) return -1;

while (q1.size() > 1) {

int temp = q1.front();

q1.pop();

q2.push(temp);

}

int result = q1.front();

q1.pop();

std::swap(q1, q2);

return result;

}

};

int main() {

Stack s; // TEST CASES

s.push(1);

s.push(2);

s.push(3);

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

s.push(10);

s.push(20);

s.push(30);

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

std::cout << s.pop() << std::endl;

return 0;

}