#include <bits/stdc++.h>
const int maxn = 1e5 + 10;
long long n, ans[maxn];
int cnt;
long long in() {
  long long re = 0;
  char ch = getchar();
  bool f = 0;
  while (ch < '0' || ch > '9') f |= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9')
    re = (re << 1) + (re << 3) + (ch ^ '0'), ch = getchar();
  return f ? -re : re;
}
int main() {
  n = in();
  long long tp = sqrt(n);
  for (int i = 1; i <= tp; ++i)
    if (n % i == 0) {
      ans[++cnt] = ((n - i) / i + 1) * (n - i + 2) / 2;
      if (n / i != i)
        ans[++cnt] = ((n - n / i) / (n / i) + 1) * (n - n / i + 2) / 2;
    }
  std::sort(ans + 1, ans + 1 + cnt);
  for (int i = 1; i <= cnt; ++i) printf("%lld ", ans[i]);
  return 0;
}
