[2749] 피보나치 수 3

#include <iostream>
using namespace std;
int iterative_fib(long long n);
int fib[1500000];
int main()
{
	long long n;
	cin >> n;
	cout << iterative_fib(n) << endl;
	return 0;
}
int iterative_fib(long long n)
{
	fib[1] = 1;
	for (int i = 2; i <= 1500000; i++)
		fib[i] = (fib[i - 1] + fib[i - 2]) % 1000000;
	return fib[n % 1500000];
}