#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long long arr[1001000];
int n;
int nn = 0;
void solve(int i) {
  long long first = n / i - 1;
  first = first + 1 + first * (first + 1) / 2 * i;
  arr[nn++] = first;
}
int main() {
  gn(n);
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      solve(i);
      solve(n / i);
    }
  sort(arr, arr + nn);
  nn = unique(arr, arr + nn) - arr;
  for (int i = 0; i < nn; i++) printf("%I64d ", arr[i]);
}
