#include int main() { int N; scanf("%d", &N); // Number of edges printf("%d\n", N - 1); // Build chain for (int i = 1; i < N; i++) { int w = 2 * i - 1; printf("%d %d %d\n", i, i + 1, w); } // Output Q(i,j) for (int i = 1; i <= N; i++) { for (int j = i + 1; j <= N; j++) { for (int k = i; k < j; k++) { printf("%d", k); if (k != j - 1) printf(" "); } printf("\n"); } } return 0; }