#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int k = (sqrt(1 + 8 * n) - 1) / 2;
  int ar[k];
  if (k == 1)
    ar[0] = n;
  else {
    long long sum = ((k - 1) * k) / 2;
    for (int i = 0; i < k - 1; i++) {
      ar[i] = i + 1;
    }
    ar[k - 1] = n - sum;
  }
  cout << k << endl;
  for (int i = 0; i < k; i++) {
    cout << ar[i] << " ";
  }
}
