Отношения

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);
ll C(ll n, ll k)
{
    ll res = 1;
    for (int i = n; i > n-k; i--)
    {
        res *= i;
    }
    ll dec = 1;
    for (int i = k; i >= 1; i--)
        dec *= i;
    res /= dec;
    return res;
}
ll A(ll n, ll k)
{
    ll res = 1;
    for (int i = n; i > n - k; i--)
    {
        res *= i;
    }
    return res;
}
ll fct(ll n)
{
    ll res = 1;
    for (int i = 1; i <= n; i++)
        res *= i;
    return res;
}
int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    ll arr[11][11] = { 0 };
    arr[1][1] = 1;
    for (int i = 2; i <= 10; i++)
        for (int j = 1; j <= 10; j++)
        {
            arr[i][j] = arr[i - 1][j] * j + arr[i - 1][j - 1];
        }
    ll n;
    cin >> n;
    while (n!=-1)
    {
        ll sc = 0;
        for (int i = 1; i <= n; i++)
        {
            sc += arr[n][i] * fct(i);
        }
        cout << sc << endl;
        cin >> n;
    }

    return 0;
}