Broken Tree - generator

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define pc(C) (putchar_unlocked(C))
ll R(int b=62){ll r(0);F(b)r<<=1,r|=rand()&1;return r;}
#define r rand()
#define GR int a,b;a=b=R()%N;while(a==b)a=R()%N;
#define MX (200009)
int A[MX];
int main(void){
    srand(time(0));
    int N=R()%10+2;
    printf("%d\n",N);
    iota(A,A+N,1),random_shuffle(A+1,A+N);
    FT(1,N)printf("%d %d %d %d\n",A[R()%k],A[k],r%10+1,r%(10+N-k)+1);
    return 0;
}