#include <bits/stdc++.h>
using namespace std;
const long long MODULE = 998244353;
set<long long> ans;
long long n;
void process(long long dividor_tmp) {
  long long maxn = n / dividor_tmp;
  long long sum = (maxn - 1) * (maxn) / 2LL;
  sum *= dividor_tmp;
  sum += maxn;
  ans.insert(sum);
}
void solve() {
  cin >> n;
  long long sqrtN = sqrt(n) + 1;
  for (long long dividor = 1; dividor <= sqrtN; dividor++) {
    if (n % dividor) {
      continue;
    }
    process(dividor);
    process(n / dividor);
  }
  for (auto it : ans) {
    cout << it << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
