What is the order of f=(nlog(log n)/ log n? Will it be O(n)?

I was wondering the O(n) time for my function. I beleive it is O(n) since log(log(n)) <= log(n) giving us N< c* n^c, resulting in lowest possible value of 1