#include <bits/stdc++.h>
using namespace std;
int power(int a, int b) {
  if (b == 0) return 1;
  return a * power(a, b - 1);
}
int main() {
  vector<int> primes;
  primes.push_back(2);
  for (int i = 3; i < 32000; i++) {
    primes.push_back(i);
    for (auto p : primes) {
      if (p > sqrt(i)) break;
      if (i % p == 0) {
        primes.pop_back();
        break;
      }
    }
  }
  int n;
  cin >> n;
  long long int keepn;
  keepn = n;
  vector<pair<int, int> > factors;
  for (auto p : primes) {
    if (p > sqrt(n))
      break;
    else if (n % p == 0) {
      factors.push_back(make_pair(p, 0));
      while (n % p == 0) {
        n /= p;
        factors[factors.size() - 1].second++;
      }
    }
  }
  if (n != 1) factors.push_back(make_pair(n, 1));
  vector<int> divisors;
  divisors.push_back(1);
  for (auto f : factors) {
    vector<int> auxDivisors;
    for (int i = 1; i <= f.second; i++) {
      for (auto d : divisors) {
        auxDivisors.push_back(power(f.first, i) * d);
      }
    }
    for (auto a : auxDivisors) {
      divisors.push_back(a);
    }
  }
  sort(divisors.begin(), divisors.end());
  vector<long long int> values;
  for (auto d : divisors) {
    long long int val = (keepn - d) * (keepn / d) / 2 + (keepn / d);
    values.push_back(val);
  }
  sort(values.begin(), values.end());
  for (auto v : values) cout << v << " ";
  return 0;
}
