#include <bits/stdc++.h>   using namespace std;   long long calc(int n, int k) {     int c = n / k;     long long ans = c;     ans += (long long)(n - k) * c / 2;     return ans;   }   int main() {     int n;     cin >> n;     vector<long long> a;     for (int i = 1; i * i <= n; i++)       if (n % i == 0) {         a.push_back(calc(n, i));         if (i * i != n) a.push_back(calc(n, n / i));       }     sort(a.begin(), a.end());     a.erase(unique(a.begin(), a.end()), a.end());     for (long long first : a) printf( %I64d  , first);     return 0;   }   