#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
set<long long> fun;
fun.insert(1);
fun.insert(n * (n + 1) / 2);
for (int k = 2; k * k <= n; k++) {
if (n % k == 0) {
long long m = n / k;
long long t1 = m * (2 + (m - 1) * k) / 2;
long long t2 = k * (2 + (k - 1) * m) / 2;
fun.insert(t1);
fun.insert(t2);
}
}
for (auto val: fun) {
cout << val << " ";
}
cout << endl;
return 0;
}
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |