矩阵快速幂

#include <iostream>
using namespace std;

const int mod = 10003;
const int num = 2;

struct mat {
    long long m[num][num];
};



mat mul(mat a, mat b) {
    mat ans;
    for (int i = 0; i<num; i++)
        for (int j = 0; j < num; j++) {
            ans.m[i][j] = 0;
            for (int k = 0; k < num; k++)
                ans.m[i][j] += (a.m[i][k] * b.m[k][j]);
            ans.m[i][j] %= mod;
        }
    return ans;
}

mat quick_pow(mat a, long long b) {
    mat ans{
        1,0,
        0,1
    };
    mat tmp = a;

    while (b>0) {
        if (b & 1)
            ans = mul(ans, tmp);
        tmp = mul(tmp, tmp);
        b >>= 1;
    }
    return ans;
}

int main() {
    int n;
    while (cin>>n)
    {
        mat a{
            1,1,
            1,0
        };
        mat ans = quick_pow(a, n);
        cout << ans.m[0][1] << endl;
    }
    return 0;
}