A lumberjack is building a non-degenerate triangle out of logs. Two sides of the triangle have lengths $\log 101$ and $\log 2018$. The last side of his triangle has side length $\log n$, where $n$ is an integer. How many possible values are there for $n$?

Let's think step by step and output the final answer within \boxed{}.
user