I'm stucked with a question here, which is to create an algorithm that takes the execution time of O(log cubed n), the log used here is of base 2.

I came out with this solution, it's close to the answer...but still not close enough.

Java Code:
public class LogCubedN
{

         int count = 0;

    public void run(int n)
    {
        for(int i = 1; i<n; i*=2)
        {
            count++;
            for(int x = 1; x<n; x*=2)
            {
                count++;
                for(int y = 1; y<n; y*=2)
                {
                count++;
                }
            }
        }
        System.out.println(count);
    }


}