What is the time complexity of the following code?

private static void methodA( int n) {

int side = (int) Math.pow(2, n);

for (int i = 0; i < side; i++) {

String r = methodB(n);

//assume some list exits

list.add(r);

}

}

private static String methodB( int n) {

String result = Integer.toBinaryString(currentCorner);

while (result.length() < n) {

result += ""; }

return result;

}