#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int Factor(int n)
{
vector<int> res;
for (int i = 1; i <=n; i=i+2)
if (n%i == 0)
res.push_back(i);
sort(res.begin(), res.end());
return *(res.end() - 1);
}
int main()
{
int tem, x;
int sum = 0;
cin >> x;
int end = x;
for (int i = 1; i <= end; i++)
sum += Factor(i);
cout << sum << endl;
return 0;
}
#include<vector>
#include<algorithm>
using namespace std;
int Factor(int n)
{
vector<int> res;
for (int i = 1; i <=n; i=i+2)
if (n%i == 0)
res.push_back(i);
sort(res.begin(), res.end());
return *(res.end() - 1);
}
int main()
{
int tem, x;
int sum = 0;
cin >> x;
int end = x;
for (int i = 1; i <= end; i++)
sum += Factor(i);
cout << sum << endl;
return 0;
}