#include <bits/stdc++.h>
using namespace std;
long long maxi = LLONG_MAX;
long long mini = LLONG_MIN;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int main() {
  fast();
  long long n;
  cin >> n;
  vector<long long> fc;
  for (long long i = 1; i < sqrt(n) + 2; i++) {
    if (n % i == 0) {
      fc.push_back(i);
      fc.push_back(n / i);
    }
  }
  sort(fc.begin(), fc.end());
  fc.erase(unique(fc.begin(), fc.end()), fc.end());
  vector<long long> ans;
  for (auto k : fc) {
    long long m = 0;
    long long sum = 0;
    long long cnt = n / k;
    sum = (cnt) + (cnt * (cnt - 1) * k) / 2;
    ans.push_back(sum);
  }
  sort(ans.begin(), ans.end());
  ans.erase(unique(ans.begin(), ans.end()), ans.end());
  for (long long abc = 0; abc < ans.size(); abc++) cout << ans[abc] << ' ';
  cout << '\n';
  ;
  ;
  return 0;
}
