#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
const int maxn = 1e3 + 5;
const double eps = 0.00000001;
const int INF = 0x3f3f3f3f;
int main() {
  long long n;
  cin >> n;
  vector<long long> vec;
  auto test = [&](int g) {
    int k = n / g;
    int first = 1;
    int last = (1 + (k - 1) * g);
    vec.push_back((long long)(first + last) * k / 2);
  };
  for (int d = 1; d * d <= n; d++) {
    if (n % d == 0) {
      test(d);
      test(n / d);
    }
  }
  sort(vec.begin(), vec.end());
  vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
  for (int i = 0; i < (int)vec.size(); i++) {
    if (i) cout << " ";
    cout << vec[i];
  }
  cout << endl;
  return 0;
}
