from cmath import *
from math import *
from decimal import *
from collections import *
import numbers
from operator import index
import sys
def _input(): return map(int, input().split())
def _list(): return list(map(int, input().split()))
def _int(): return int(input())
def solves():
n=int(input())
print(n)
for i in range(1,n+1):
print (i,end=' ')
print()
t=1
t =int(input())
for _ in range(0,t):
solves()
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <iostream>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<deque>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<stack>
#include<algorithm>
const int N = 2e5 + 10;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
cout << n - 1 << endl;
for (int i = 2; i <= n; i++) cout << i << " ";
cout << endl;
}
return 0;
}
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |