#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1.0L);
const long double EPS = 1e-12L;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
namespace task {
int n, k;
vector<int> r;
map<int, int> m;
set<int64_t> a;
int main() {
  cin >> n;
  k = n;
  for (int i = 2; i * i <= n; ++i) {
    while (k % i == 0) {
      k /= i;
      ++m[i];
    }
  }
  if (k != 1) {
    ++m[k];
  }
  r.push_back(1);
  for (auto v : m) {
    k = r.size();
    for (int i = 0; i < k; ++i) {
      int t = 1;
      for (int j = 0; j < v.second; ++j) {
        t *= v.first;
        r.push_back(r[i] * t);
      }
    }
  }
  for (int v : r) {
    a.insert((n - v) * 1LL * (n / v) / 2LL + (n / v));
  }
  for (int64_t v : a) {
    cout << v << ' ';
  }
  cout << '\n';
  return 0;
}
}  // namespace task
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(11);
  cout.setf(ios::fixed);
  return task::main();
}
