#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<long long> divs;
  for (long long i = 1; i <= sqrt(n) + 1; i++) {
    if (n % i == 0) {
      divs.push_back(i);
      divs.push_back(n / i);
    }
  }
  vector<long long> gcds;
  for (int i = 0; i < divs.size(); i++) {
    gcds.push_back(gcd(n, divs[i]));
  }
  set<long long> ans;
  for (int i = 0; i < gcds.size(); i++) {
    long long k = gcds[i];
    ans.insert((long long)(((double)n / k) * (n - k + 2.) / 2.));
  }
  cout << *ans.begin();
  ans.erase(ans.begin());
  for (auto i = ans.begin(); i != ans.end(); i++) {
    cout << ' ' << *i;
  }
  cout << endl;
  return 0;
}
