Thank you very much, I have already tried these.

I was just curious if there was any way to properly submit my solution.

But really thank you!

Optimize your solution for n as large as 10¹⁰.

You could comment out the 1e6 example test; if you can pass the smaller ones you know you need moar speed.

My attempt to run the test fails as it always times out.

I assume it's because n couldn't be more than a certain amount?

I am really sorry if the solution is just as obvious as it may seem, but I am quite a rookie in this whole coding field.

I would honestly appreciate any help!