#include <bits/stdc++.h>
using namespace std;
long long ans[100002];
int main() {
  long long n, temp, arr[100001], num = 0, num2 = 0;
  scanf("%lld", &n);
  temp = sqrt(n);
  for (int i = 1; i <= temp; i++) {
    if (!(n % i)) {
      if (i != (n / i)) {
        arr[num++] = i;
        arr[num++] = (n / i);
      } else
        arr[num++] = i;
    }
  }
  for (int i = 0; i < num; i++) {
    long long m = n / arr[i], d = arr[i];
    long long sum = m + (m * m - m) * d / 2;
    ans[num2++] = sum;
  }
  sort(ans, ans + num2);
  for (int i = 0; i < num2; i++) printf("%lld ", ans[i]);
  return 0;
}
