What is the Big-O runtime of this code segment?

int MysteryO (int N) { int res = 0; int idx = 1; while (idx < N) { for(int j = 0; j < N; j += 2) { res = res * 3; } idx = idx * 2; } return res; }