分析:需要一点逆向思维;
#include<bits/stdc++.h>
using namespace std;
int a[10100];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<n+1<<endl;
// int x=n-1-a[n-1]%(n-1);
int x=0;
// cout<<1<<" "<<n<<" "<<x<<endl;
for(int i=n-1;i>=0;i--){
int cnt=x;
if((a[i]+x)%n>i){
cnt+=n-(a[i]+x)%n+i;
}
else if((a[i]+x)%n<i){
cnt+=i-(a[i]+x)%n;
}
cout<<1<<" "<<i+1<<" "<<cnt-x<<endl;
x=cnt;
// cout<<"asd"<<endl;
}
cout<<2<<" "<<n<<" "<<n<<endl;
}