#include<bits/stdc++.h>
#define f1(i, n) for(int i=1;i<=n;++i)
#define f0(i, n) for(int i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 1e6 + 1;
const int N = 5e5 + 1;
const ll mod = 1e8;
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ll n;
	cin >> n;
	ll res;
	if (n % 2 == 0) {
		res = (((n / 2) % mod) * ((n + 1) % mod)) % mod;
	}
	else {
		res = ((((n + 1) / 2) % mod) * (n % mod)) % mod;
	}
	cout<<(res * res) % mod;
 
}
 
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBmMShpLCBuKSBmb3IoaW50IGk9MTtpPD1uOysraSkKI2RlZmluZSBmMChpLCBuKSBmb3IoaW50IGk9MDtpPG47KytpKQojZGVmaW5lIHVsbCB1bnNpZ25lZCBsb25nIGxvbmcKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSByZXYoYSkgcmV2ZXJzZShhLmJlZ2luKCksYS5lbmQoKSkKI2RlZmluZSBhbGwoeCkgeC5iZWdpbigpLHguZW5kKCkKI2RlZmluZSBzbyhBLCBuKSBzb3J0KEErMSwgQStuKzEpCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBtYXhuID0gMWU2ICsgMTsKY29uc3QgaW50IE4gPSA1ZTUgKyAxOwpjb25zdCBsbCBtb2QgPSAxZTg7CmludCBtYWluKCkKewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsgY2luLnRpZSgwKTsgY291dC50aWUoMCk7CglsbCBuOwoJY2luID4+IG47CglsbCByZXM7CglpZiAobiAlIDIgPT0gMCkgewoJCXJlcyA9ICgoKG4gLyAyKSAlIG1vZCkgKiAoKG4gKyAxKSAlIG1vZCkpICUgbW9kOwoJfQoJZWxzZSB7CgkJcmVzID0gKCgoKG4gKyAxKSAvIDIpICUgbW9kKSAqIChuICUgbW9kKSkgJSBtb2Q7Cgl9Cgljb3V0PDwocmVzICogcmVzKSAlIG1vZDsKCn0KCg==