#include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff
typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<ld> vld;

#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()

int main()
{
	fastIO;
	ll n; cin >> n;
	set<ll> s;
	for(ll i = 1; i*i <= n; i++)
	{
		if(n % i == 0) 
		{
			s.insert(i);
			s.insert(n / i);
		}
	}
	for(auto x : s) cout << x << endl;

	return 0;
}
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>


using namespace std;

typedef unsigned long long ull;

int main() {
	ull n, k, m, ans;

	cin >> n;

	k = 1;
	m = n + 1;
	ans = 1;

	m = n;
	k = 2;
	while (m > k) {
		ans++;

		m -= k;
		if (m > k) {
			ans += (k - 1);
		}
		else {
			ans += (m - 1);
		}
		k++;
	}

	cout << ans << endl;
}