#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n;
long long f[5000010];
int tot = 0;
int main() {
  cin >> n;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      long long t = n / i + 1LL * i * (n / i - 1) * (n / i) / 2;
      f[++tot] = t;
      int q = n / i;
      t = n / q + 1LL * q * (n / q - 1) * (n / q) / 2;
      f[++tot] = t;
    }
  }
  sort(f + 1, f + tot + 1);
  for (int i = 1; i <= tot; i++)
    if (i == 1 || f[i] != f[i - 1]) printf("%lld ", f[i]);
  printf("\n");
  return 0;
}
