#include <iostream>
#include <deque>
using namespace std;
int fibonacci_sum_deque(long long n) {
if (n <= 2)
return n;
deque<int> sum(4);
sum[0] = 0;
sum[1] = 1;
sum[2] = 2;
for (long long i = 3; i <= n; ++i) {
sum[3] = (sum[2] + sum[1] + 1) % 10;
sum.pop_front();
std::cout << sum.size() << '\n';
}
return sum[2];
}
int main() {
long long n = 0;
cin >> n;
cout << fibonacci_sum_deque(n);
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8ZGVxdWU+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGZpYm9uYWNjaV9zdW1fZGVxdWUobG9uZyBsb25nIG4pIHsKICBpZiAobiA8PSAyKQogICAgcmV0dXJuIG47CgogIGRlcXVlPGludD4gc3VtKDQpOwogIHN1bVswXSA9IDA7CiAgc3VtWzFdID0gMTsKICBzdW1bMl0gPSAyOwoKICBmb3IgKGxvbmcgbG9uZyBpID0gMzsgaSA8PSBuOyArK2kpIHsKICAgIHN1bVszXSA9IChzdW1bMl0gKyBzdW1bMV0gKyAxKSAlIDEwOwogICAgc3VtLnBvcF9mcm9udCgpOwogICAgc3RkOjpjb3V0IDw8IHN1bS5zaXplKCkgPDwgJ1xuJzsKICB9CgogIHJldHVybiBzdW1bMl07Cn0KCmludCBtYWluKCkgewogICAgbG9uZyBsb25nIG4gPSAwOwogICAgY2luID4+IG47CiAgICBjb3V0IDw8IGZpYm9uYWNjaV9zdW1fZGVxdWUobik7Cn0K