C++：

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <math.h>
#include <functional>
#include <string>
#define endl '\n'
#define pii pair<int, int>
#define pdd pair<double, double> 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define codeforces cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define bendl(x) x.begin(), x.end()
#define siz(x) ((int)(x).size())
#define int long long

using namespace std;
const int inf = 1 << 30;
const int mod = 998244353;
const int N = 2e5 + 10, M = N << 1;

struct aaa{
	int a=0,b=0;
};
bool cmp(int a,int b){
	return a>b;
}
void solve(){
	int n;cin >> n;
	int i;cin >> i;
	int ans=1;
	for(int j=n;j>1;j++){
		ans*=n/j;
		ans++;
	}
	cout << ans;
}
signed main(){
	codeforces;
	int t=1;
	//cin >> t;//codeforces
	while(t--)solve();
}

代码大面积测试~~~~(>_<)~~~~