#include <bits/stdc++.h>
using namespace std;
long long int po(long long int x, long long int n, long long int mod) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2 == 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return res % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> factors;
  for (long long int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      factors.push_back(i);
      if (n / i != i) factors.push_back(n / i);
    }
  }
  set<long long int> answer;
  for (long long int i = 0; i < factors.size(); i++) {
    long long int tmp = (n / factors[i]);
    long long int res = (tmp * (2 + (tmp - 1) * factors[i]) / 2);
    answer.insert(res);
  }
  for (auto i : answer) cout << i << " ";
  return 0;
}
