#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2>& p) {
  out << p.first << ' ' << p.second;
}
template <class T>
istream& operator>>(istream& in, vector<T>& v) {
  for (auto& x : v) in >> x;
  return in;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto x : v) out << x << ' ';
  return out;
}
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n;
  cin >> n;
  vector<int> div;
  for (long long int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      div.push_back(i);
      if (i != (n / i)) div.push_back(n / i);
    }
  }
  sort((div).begin(), (div).end());
  vector<long long int> ans;
  for (long long i = (0); i < (div.size()); ++i) {
    long long int last = n - div[i] + 1;
    long long int nm = (last - 1) / div[i] + 1;
    ans.push_back(((nm) * (1 + last)) / 2);
  }
  set<long long int> st((ans).begin(), (ans).end());
  vector<long long int> ans1((st).begin(), (st).end());
  sort((ans1).begin(), (ans1).end());
  cout << ans1;
}
