Greedy Algorithm find the maximum number of pairwise different pairs of integers that sum up to n

Python 3 Pairwise Different Summands

'''
Advanced code problem: pairwise different summands

Given an integer 1≤n≤109 find the maximal number k such that n can be represented as a sum of pairwise different positive integers. In the first line output k, in the next line output k summands.

Sample Input 1:
4
Sample Output 1:
2
1 3 

Sample Input 2:
6
Sample Output 2:
3
1 2 3 

Memory Limit: 256 MB
Time Limit: 5 seconds
'''
n = int(input())

total = 0
increment = 1
count = 0
listOfNum = []

while total + increment <= n:
    total += increment
    listOfNum.append(increment)
    increment += 1
    count += 1

listOfNum[count-1] += n - total

print(count)
print(*listOfNum)

Your code logic in not proper as required