#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <fstream>
#include <string>
#include <set>
#include <deque>
#include <queue>
#include <map>
#include <bitset>
#include <random>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long              ll;
typedef unsigned long long     ull;
typedef long double            ld;
#define sqrt              sqrtl
#define endl              "\n"
#define all(a)            a.begin(), a.end()
#define allr(a)           a.rbegin(), a.rend()
#define pb                push_back
#define F                 first
#define S                 second
//3
//4
//4 4 4 4
//0
//4
//1 2 4 4
//1
const int mod = 10000;
template<typename T>
T add(T x) {
    return x;
}

template<typename T, typename... Ts>
T add(T x, Ts... y) {
    T res = x + add(y...);
    if (res >= mod)
        res -= mod;
    return res;
}
template<typename T, typename... Ts>
T sub(T x, Ts... y) {
    return add(x, mod - add(y...));
}

template<typename T, typename... Ts>
void udd(T& x, Ts... y) {
    x = add(x, y...);
}


template<typename T>
T mul(T x) {
    return x;
}

template<typename T, typename... Ts>
T mul(T x, Ts... y) {
    return (x * 1ll * mul(y...)) % mod;
}

template<typename T, typename... Ts>
void uul(T& x, Ts... y) {
    x = mul(x, y...);
}
void solve() {}
ll bin(ll a, ll deg) {
    ll r = 1;
    while (deg) {
        if (deg & 1)
            uul(r, a);
        deg >>= 1;
        uul(a, a);
    }
    return r;
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll t = 1;
    ll sum = 0;
    ll buf = bin(5, 25);
    for (ll i = 1; i <= 14;i++) {
        ll pre = bin(buf, i);
        sum+=pre;
        sum %= 10000;
    }
    cout << sum << endl;
}