#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void prime(long long int a, vector<long long int> &v) {
  for (long long int i = 2ll; i * i <= a; i++) {
    if (a % i == 0ll) v.push_back(i);
    while (a % i == 0ll) {
      a = a / i;
    }
  }
  if (a > 1ll) v.push_back(a);
}
bool isprime(long long int a) {
  for (long long int i = 2; i * i <= a; i++)
    if (a % i == 0) return false;
  return true;
}
long long int expmod(long long int a, long long int b) {
  if (b == 1) return a;
  if (b == 0) return 1;
  long long int m1 = expmod(a, b / 2) % mod;
  if (b % 2) return ((m1 * m1) % mod * a % mod) % mod;
  return (m1 * m1) % mod;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
struct myComp {
  constexpr bool operator()(pair<int, pair<int, int>> const &a,
                            pair<int, pair<int, int>> const &b) const noexcept {
    if (a.first < b.first) return true;
    if (a.first > b.first) return false;
    return a.second.first > b.second.first;
  }
};
class compare {
 public:
  bool operator()(pair<int, long long int> &p, pair<int, long long int> &q) {
    return p.second >= q.second;
  }
};
long long int bs1(long long int a[], long long int n, long long int x) {
  long long int anss = -1;
  long long int l = 0;
  long long int h = n - 1;
  while (l <= h) {
    long long int mid = l + (h - l) / 2;
    if (a[mid] <= x) {
      anss = mid;
      l = mid + 1;
    } else
      h = mid - 1;
  }
  return anss;
}
long long int bs2(long long int a[], long long int n, long long int x) {
  long long int anss = -1;
  long long int l = 0;
  long long int h = n - 1;
  while (l <= h) {
    long long int mid = l + (h - l) / 2;
    if (a[mid] > x) {
      anss = mid;
      h = mid - 1;
    } else
      l = mid + 1;
  }
  return anss;
}
int bs3(vector<int> a, int x) {
  int anss = -1;
  int l = 0;
  int h = a.size() - 1;
  while (l <= h) {
    int mid = l + (h - l) / 2;
    if (a[mid] <= x) {
      anss = mid;
      l = mid + 1;
    } else
      h = mid - 1;
  }
  return anss;
}
bool f = 0;
int c[2000][2000];
void do_it(int i, int j, int v) {
  if (c[i][j] == -1) {
    c[i][j] = v;
  } else {
    if (c[i][j] != v) f = 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int test;
  cin >> test;
  while (test--) {
    int n;
    cin >> n;
    set<int> s;
    s.insert(0);
    for (int i = 1; i * i <= n; i++) {
      s.insert(n / i);
      s.insert(i);
    }
    cout << s.size() << "\n";
    for (auto b : s) cout << b << " ";
    cout << "\n";
  }
}
