#include <bits/stdc++.h>
using namespace std;
long long n;
long long ans[1000005] = {0};
long long cnt = 0;
int main() {
  scanf("%d", &n);
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      ans[++cnt] = (1 + n - i + 1) * (n / i) / 2;
      if (i == sqrt(n) && sqrt(n) == (long long)(sqrt(n))) continue;
      long long ii = n / i;
      ans[++cnt] = (1 + n - ii + 1) * (n / ii) / 2;
    }
  }
  sort(ans + 1, ans + cnt + 1);
  ans[1] = 1;
  for (long long i = 1; i <= cnt; i++) printf("%I64d ", ans[i]);
  return 0;
}
