#include <bits/stdc++.h>   using namespace std;   const long long maxn = 100010;   long long n, S[maxn], top, ans[maxn], cnt;   int main() {     cin >> n;     for (long long i = 1; i * i <= n; i++)       if (n % i == 0) {         S[++top] = i;         if (i * i != n) S[++top] = n / i;       }     for (long long i = 1; i <= top; i++) {       long long temp = (n - 1) / S[i];       temp++;       long long temp2 = (n - 1) / S[i];       temp2 = temp2 * S[i] + 2;       temp = temp * temp2;       ans[++cnt] = temp / 2;     }     sort(ans + 1, ans + 1 + cnt);     cnt = unique(ans + 1, ans + 1 + cnt) - ans - 1;     for (int i = 1; i <= cnt; i++) cout << ans[i] <<    ;     return 0;   }   