#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }
int Set(int N, int pos) { return N = N | (1 << pos); }
int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1};
int hr[] = {-2, -2, -1, +1, +2, +2, -1, +1};
int hc[] = {+1, -1, +2, +2, -1, +1, -2, -2};
int dx[] = {+1, -1, +0, +0};
int dy[] = {+0, +0, +1, -1};
const int MAXN = (int)1e5 + 9;
int main() {
  long long i, j, k, l, m, n, p, q, x, y, u, v, r, tc, t;
  cin >> n;
  vector<long long> D;
  for (i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (i == n / i)
        D.push_back(i);
      else {
        D.push_back(i);
        D.push_back(n / i);
      }
    }
  }
  vector<long long> ans;
  for (i = 0; i < D.size(); i++) {
    k = (n - 1) / D[i] + 1;
    m = 2 + (k - 1) * D[i];
    m = k * m;
    ans.push_back(m / 2);
  }
  sort(ans.begin(), ans.end());
  for (i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
