#include <bits/stdc++.h>
using namespace std;
long long n, u1, u2, tmp, kq[100005], o = 0;
map<long long, bool> tick;
long long check(long long st) {
  if (st == 1 || st == n - 1) {
    if (n % 2 == 0)
      return (n / 2) * (n + 1);
    else
      return n * ((n + 1) / 2);
  }
  if (st == n) return 1;
  long long an = n + 1 - st;
  long long nn = (an - 1) / st + 1;
  return nn * (1 + an) / 2;
}
int main() {
  cin >> n;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      u1 = i;
      u2 = n / i;
      tmp = check(u1);
      if (!tick[tmp]) {
        kq[++o] = tmp;
        tick[tmp] = true;
      }
      tmp = check(u2);
      if (!tick[tmp]) {
        kq[++o] = tmp;
        tick[tmp] = true;
      }
    }
  }
  sort(kq + 1, kq + 1 + o);
  for (int i = 1; i <= o; i++) cout << kq[i] << " ";
  return 0;
}
