#include <bits/stdc++.h>
using namespace std;
long long solve(int n, int x) {
  int k = n / x;
  return k + 1LL * k * (k - 1) / 2 * x;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> v;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      v.push_back(i);
      v.push_back(n / i);
    }
  sort(v.begin(), v.end(), greater<int>());
  v.resize(unique(v.begin(), v.end()) - v.begin());
  for (int i = 0; i < v.size(); i++) cout << solve(n, v[i]) << " ";
  cout << "\n";
  return 0;
}
