#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const long double eps = 1e-20;
const int mod = 1e9 + 7;
const int M = 200010;
int tot, a[M], n;
int main(int argc, char const *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      a[tot++] = i;
      if (i * i != n) a[tot++] = n / i;
    }
  }
  sort(a, a + tot);
  for (int i = tot - 1; i >= 0; i--) {
    int k = n / a[i];
    long long int ans = (long long int)((k - 1) * a[i] + 2);
    ans *= k;
    printf("%lld ", ans / 2);
  }
}
