#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> v;
int main() {
  scanf("%d", &n);
  int pp = 1;
  for (int i = 1; i < 999; i++) pp++;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (i * i != n) {
        v.push_back(n / i);
      }
    }
  }
  v.push_back(n);
  v.push_back(1);
  vector<long long> G;
  for (auto it : v) {
    long long ans = n - it + 1;
    G.push_back((ans + 1) * ((ans - 1) / it + 1) / 2);
  }
  sort(G.begin(), G.end());
  for (int i = 0; i < G.size(); i++) {
    printf("%lld ", G[i]);
  }
  return 0;
}
