#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000005;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-10;
const double Pi = acos(-1.0);
long long ret[maxn];
long long n;
int main() {
  scanf("%I64d", &n);
  long long cnt = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i) {
      continue;
    }
    int c = n / i;
    ret[cnt++] = (2 + i * (c - 1)) * c / 2;
    if (i * i != n) {
      c = i;
      ret[cnt++] = (2 + n / i * (c - 1)) * c / 2;
    }
  }
  sort(ret, ret + cnt);
  for (int i = 0; i < cnt; i++) {
    printf("%I64d ", ret[i]);
  }
  return 0;
}
