#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
long long cnt = 0, n;
long long ans[N];
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long calc(long long a) {
  long long p = n / a;
  return p + a * (p) * (p - 1) / 2;
}
int main() {
  cin >> n;
  long long limit = sqrt(n);
  for (long long i = 1; i < sqrt(n); i++) {
    if (n % i == 0) {
      if (gcd(i, n) == i) {
        ans[++cnt] = calc(i);
      }
      if (gcd(n / i, n) == n / i) {
        ans[++cnt] = calc(n / i);
      }
    }
  }
  if (limit * limit == n && gcd(n, limit) == limit) {
    ans[++cnt] = calc(limit);
  }
  sort(ans + 1, ans + cnt + 1);
  cnt = unique(ans + 1, ans + cnt + 1) - ans - 1;
  for (long long i = 1; i <= cnt; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
