#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  scanf("%lld", &n);
  vector<long long> a;
  long long i, j, k, ii;
  for (i = 1; (i * i) <= n; i++) {
    if (n % i == 0) {
      j = (n / i) + 1;
      j--;
      k = (j) * (2 + ((j - 1) * i));
      k = k / 2;
      a.push_back(k);
      if (i != (n / i)) {
        ii = n / i;
        j = (n / ii) + 1;
        j--;
        k = (j) * (2 + ((j - 1) * ii));
        k = k / 2;
        if (k == 0) {
          a.push_back(1);
        } else {
          a.push_back(k);
        }
      }
    }
  }
  sort(a.begin(), a.end());
  for (i = 0; i < a.size(); i++) {
    printf("%lld ", a[i]);
  }
  return 0;
}
