This program calculates the nth Fibonacci number in O(log(n)). It's possible to calculate F(1_000_000) in less than a second.

multiplication of size 2 by 2. And on the other hand complexity of bruteforce solution is O(n).