#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, i, m, k;
  cin >> n;
  map<long long, long long> factors;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (!factors.count(i)) {
        factors.insert(pair<long long, long long>{i, 1});
      }
      long long temp = n / i;
      if (temp != i) {
        if (!factors.count(temp))
          factors.insert(pair<long long, long long>{temp, 1});
      }
    }
  }
  set<long long> ans;
  long long u = n * (n + 1);
  u /= 2;
  ans.insert(u);
  ans.insert(1);
  for (i = 2; i <= sqrt(n); i++) {
    if (factors.count(i)) {
      long long k = n + i - 1;
      long long no = k / i;
      long long an = 1 + (no - 1) * i;
      long long sum = no * (1 + an);
      sum /= 2;
      ans.insert(sum);
    }
    long long temp = n / i;
    if (factors.count(temp)) {
      long long k = n + temp - 1;
      long long no = k / temp;
      long long an = 1 + (no - 1) * temp;
      long long sum = no * (1 + an);
      sum /= 2;
      ans.insert(sum);
    }
  }
  set<long long>::iterator itr;
  for (itr = ans.begin(); itr != ans.end(); ++itr) {
    cout << *itr << " ";
  }
  return 0;
}
