// Problem: P1009 [NOIP1998 普及组] 阶乘之和
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1009
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// User: Pannnn
#include
using namespace std;
vector mul(vector a, int b) {
vector res;
int p = 0;
for (int i = 0; i < a.size() || p != 0; ++i) {
if (i < a.size()) {
p += a[i] * b;
}
res.push_back(p % 10);
p /= 10;
}
return res;
}
vector sum(vector a, vector b) {
vector res;
int p = 0;
for (int i = 0; i < a.size() || i < b.size(); ++i) {
if (i < a.size()) {
p += a[i];
}
if (i < b.size()) {
p += b[i];
}
res.push_back(p % 10);
p /= 10;
}
if (p) {
res.push_back(p);
}
return res;
}
int main() {
int n;
cin >> n;
vector res;
vector tRes(1, 1);
// 高精度乘法与高精度加法
for (int i = 1; i <= n; ++i) {
tRes = mul(tRes, i);
res = sum(tRes, res);
}
for (int i = res.size() - 1; i >= 0; --i) {
cout << res[i];
}
cout << endl;
return 0;
}