#include <bits/stdc++.h>
const int MAXSQRT = 100005;
long long stk[MAXSQRT], top;
inline long long calc(int n, int m) { return ((long long)(n + 2) * m - n) / 2; }
int main() {
  int n;
  scanf("%d", &n);
  int upper = sqrt(n) + 1;
  for (int i = 1; i <= upper; ++i) {
    if (n % i == 0) {
      if (n / i < i) break;
      printf("%lld ", calc(n, i));
      if (i * i != n) stk[++top] = calc(n, n / i);
    }
  }
  while (top) {
    printf("%lld ", stk[top--]);
  }
  printf("\n");
  return 0;
}
