#include <bits/stdc++.h>
using namespace std;
long long a[100007];
long long ans[100007];
int main() {
  long long n;
  scanf("%lld", &n);
  long long cnt = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      a[++cnt] = i;
      if (i * i != n) a[++cnt] = n / i;
    }
  }
  long long mx = 0;
  for (long long i = 1; i <= cnt; i++) {
    mx = n - a[i] + 1;
    ans[i] = (1 + mx) * (n / a[i]) / 2;
  }
  long long tmp = 0;
  sort(ans + 1, ans + 1 + cnt);
  for (long long i = 1; i <= cnt; i++) printf("%lld ", ans[i]);
  return 0;
}
