#include <bits/stdc++.h>
const int mod = 1e9;
const int maxx = 1e6 + 10;
using namespace std;
long long daan[maxx];
int main() {
  long long t, i, j, k;
  long long a1, a2, a3, a4, a5;
  int ans1, ans2, sum1, sum2;
  long long cnt = 1;
  long long n, x;
  scanf("%lld", &n);
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      x = n / i;
      if (x == i) {
        daan[cnt] = ((n + 2 - x) * (x)) / 2;
        cnt++;
      } else {
        daan[cnt] = ((x) * (1 + n - i + 1)) / 2;
        cnt++;
        daan[cnt] = ((i) * (1 + n - x + 1)) / 2;
        cnt++;
      }
    }
  }
  daan[0] = 1;
  daan[cnt] = ((1 + n) * (n)) / 2;
  sort(daan, daan + cnt + 1);
  for (i = 0; i < cnt; i++) printf("%lld ", daan[i]);
  printf("%lld\n", daan[cnt]);
  return 0;
}
