#include <bits/stdc++.h>
using namespace std;
int debug = 0;
bool is_vowel(char c);
bool is_prime(long long n);
long long bigmod(long long base, long long exp, long long mod);
vector<long long> factor(long long n) {
  vector<long long> factor;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      factor.push_back(i);
      if (n / i != i) factor.push_back(n / i);
    }
  }
  return factor;
}
int main() {
  long long int n;
  cin >> n;
  std::vector<long long> v = factor(n);
  set<long long> st;
  for (long long i = 0; i < v.size(); i++) {
    long long pn;
    if (v[i] != (long long)1)
      pn = (long long)1 + ((n - (long long)1) / v[i]);
    else
      pn = n;
    long long sum =
        (((long long)2 + (pn - (long long)1) * v[i]) * pn) / (long long)2;
    st.insert(sum);
  }
  for (auto i = st.begin(); i != st.end(); i++) {
    printf("%lld ", (*i));
  }
  return 0;
}
bool is_vowel(char c) {
  if (c < 95) {
    c += 32;
  }
  return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u';
}
bool is_prime(long long n) {
  if (n == 1) return false;
  long long l = (long long)sqrt(n);
  for (int i = 2; i <= l; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long bigmod(long long base, long long exp, long long mod) {
  if (exp == 0) return 1;
  if (base == 0) return -1;
  if (exp % 2 == 0) {
    long long ans = ((bigmod(base, exp / 2, mod) % mod) + mod) % mod;
    return (((ans * ans) % mod) + mod) % mod;
  } else
    return (((((base % mod) + mod) % mod) * bigmod(base, exp - 1, mod)) + mod) %
           mod;
}
