What is the smallest $n$ such that $BB(n) > $Graham's number?

BB represents the busy beaver function here. Do we even have any idea of what order of magnitude $n$ would have? Is it possibly around 10, or more like 1000?

If I recall correctly it started with $n = 64$, then $n = 25$ shortly after that with $n=23$, $n = 22$ and now $n = 19$.

StackExchange Computer Science Q#69469, answer score: 3