#include <bits/stdc++.h>
using namespace std;
int n;
long long ans;
vector<int> v;
void init() {
  v.clear();
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (i * i != n) {
        v.push_back(n / i);
      }
    }
  }
  sort(v.begin(), v.end());
}
int main() {
  while (~scanf("%d", &n)) {
    ans = 0;
    init();
    for (int i = v.size() - 1; i >= 0; i--) {
      ans = 1ll * (1ll + 1 + (n / v[i] - 1) * v[i]) * (n / v[i]) / 2;
      printf("%lld%c", ans, i == 0 ? '\n' : ' ');
    }
  }
  return 0;
}
