//

// Created by Doubeer on 2024/2/1.

// 乒乓球

#include <iostream>

#include <cmath>

using namespace std;

int f[2] = {11,22};// 两种赛制

int a[25 * 2500 + 10],n = 0;

int main(){

    char temp;

    while(1){

        cin >> temp;

        if(temp == 'E') break;

        else if(temp = 'W') a[n++] = 1;// 华华赢

        else if(temp = 'L') a[n++] = 0;// 华华输

    }

    for(int k = 0;k < 2;k++){// 两种赛制循环

        int w = 0, l = 0;

        for(int i = 0;i < n;i++){

            w += a[i];

            l += l - a[i];

            if((max(w,l) >= f[k]) && abs(w - l) >= 2){// 获胜者超过对应分数且超过对手两分

                cout << w << ":" << l << endl;

                w = l = 0;

            }

        }

    }

}

// 扫雷

#include <iostream>

using namespace std;

const int dx[] = {1,1,1,0,0,-1,-1,-1};

const int dy[] = {-1,0,1,-1,1,-1,0,1};

const int maxn = 105;

char g[maxn][maxn];

int n,m;

int main(){

    cin >> n >> m;

    for(int i = 1;i <= n;i++)

        for(int j = 1; j <= m; j++)

            cin >> g[i][j];

    for(int i = 1; i <= n; i++){

        for(int j = 1; j <= m; j++)

            if(g[i][j] != '*'){

                int cnt = 0;

                for(int k = 0; k < 8; k++)

                    if(g[i + dx[k]][j + dy[k]] == '*') cnt++;// 八个方向

                cout << cnt;

            }

        else cout << "*";

        cout << endl;

    }

    return 0;

}

// 击鼓传花

#include <iostream>

#include <string>

using namespace std;

const int MAXN = 1e6 + 5;

struct node{// 用结构体存储同学的名字和方向

    int head;

    string name;

}a[MAXN];

int n,m,x,y;

int main(){

    cin >> n >> m;

    for(int i = 0;i < n; i++)

        cin >> a[i].head >> a[i].name;

    int  now = 0;

    for(int i; i <= m; i++){

        cin >> x >> y;//x 向左向右传递，y 传递几个人

        if(a[now].head == 0 && x == 0)

            now = (now + n - y) % n;

        else if( a[now].head == 0 && x == 1)

            now = (now + y) % n;

        else if(a[now].head == 1 && x == 0)

            now = (now + y) % n;

        else if(a[now].head == 1 && x == 1)

            now = (now + n - y) % n;

    }

    cout << a[now].name << endl;

    return  0;

}

//A+B

#include <iostream>

#include <string>

#include <algorithm>

#define maxn 520

using namespace std;

int a[maxn],b[maxn],c[maxn];

int mian(){

    string A,B;

    cin >> A >> B;

    int len = max(A.length(),B.length());

    for(int i = A.length() - 1,j = 1; i >= 0; i--,j++)

        a[j] = A[i] - '0';

    for(int i = B.length() - 1,j = 1; i >= 0; i--,j++)

        b[j] = B[i] - '0';

    for(int i = 1; i <= len; i++){

        c[i] += a[i] + b[i];

        c[i + 1] = c[i] / 10;// 模拟进位

        c[i] %= 10;

    }

    if(c[len + 1])// 最后进位可能导致位数增加

        len++;

    for(int i = len; i >= 1; i--)

        cout << c[i];

}

//A*B

#include <iostream>

#include <string>

#include <algorithm>

#define maxn 5010

using namespace std;

int a[maxn],b[maxn],c[maxn];

int main(){

    string A,B;

    cin >> A >> B;

    int lena = A.length();

    int lenb = B.length();

    for(int i = lena - 1; i >= 0; i--) a[lena - i] = A[i] - '0';

    for(int i = lenb - 1; i >= 0; i--) b[lenb - i] = B[i] - '0';

    for(int i = 1; i <= lena;i++)

        for(int j = 1;j <= lenb;j++)

            c[i + j - 1] += a[i] * b[j];// 对于 a 中的第 i 位和 b 中的第 j 位，将它们的乘积加到 c 的第 i+j-1 位上

    int len = lena + lenb;

    for(int i = 1; i <= len; i++){// 处理进位。从低位向高位遍历 c 数组，如果某一位的值大于等于 10，就向高位进位

        c[i + 1] += c[i] / 10;

        c[i] %= 10;

    }

    for(; !c[len];)// 找到结果的最高位。

        len--;

    for(int i = max(1,len); i >= 1; i--)// 从最高位开始遍历 c 数组，直到找到第一个非零的位为止。

        cout << c[i];

}

#include <iostream>

#include <vector>

using namespace std;

// 大整数相乘

vector<int> multiply(vector<int>& num, int factor) {

    vector<int> result;

    int carry = 0;

    for (int i = 0; i < num.size(); i++) {

        int product = num[i] * factor + carry;

        result.push_back(product % 10);

        carry = product / 10;

    }

    while (carry > 0) {

        result.push_back(carry % 10);

        carry /= 10;

    }

    return result;

}

// 大整数相加

vector<int> add(vector<int>& num1, vector<int>& num2) {

    vector<int> result;

    int carry = 0;

    int i = 0;

    while (i < num1.size() || i < num2.size() || carry > 0) {

        int sum = carry;

        if (i < num1.size())

            sum += num1[i];

        if (i < num2.size())

            sum += num2[i];

        result.push_back(sum % 10);

        carry = sum / 10;

        i++;

    }

    return result;

}

// 计算阶乘之和

vector<int> calculateFactorialSum(int n) {

    vector<int> factorial = {1}; // 初始化为 1

    vector<int> sum = {0}; // 初始化为 0

    for (int i = 1; i <= n; i++) {

        factorial = multiply(factorial, i);

        sum = add(sum, factorial);

    }

    return sum;

}

// 输出大整数

void printBigInteger(vector<int>& num) {

    for (int i = num.size() - 1; i >= 0; i--)

        cout << num[i];

    cout << endl;

}

int main() {

    int n;

    cin >> n;

    vector<int> result = calculateFactorialSum(n);

    printBigInteger(result);

    return 0;

}