Please can you help me to calc the complexity of this algorithm it may looks easy but i am new to all that

```
int f=1;
int x=2;
for (int i = 1; i <= n; i*=2)
for (int j = 1; j <= i * i; j++)
if (j % i == 0)
for (int k = 1; k <= j*i; k++)
f=x*f;
```

thanks in advance