Shor's algorithm is a quantum algorithm for integer factorization. What is its time complexity for a number with $n$ bits?