codeforces 1417D（思维，构造）

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=3*1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int a[N];
void solve(){
    ll sum=0;
    int n;cin>>n;
    rep(i,1,n+1) cin>>a[i],sum+=a[i];
    if(sum%n) cout<<-1<<endl;
    else{
        sum/=n;
        cout<<3*(n-1)<<endl;
        rep(i,2,n+1){
            cout<<1<<' '<<i<<' ';
            if(a[i]%i){
                int last=a[i];
                a[i]=a[i]+(i-(a[i]%i));
                cout<<a[i]-last<<endl;
            }
            else cout<<0<<endl;
            cout<<i<<' '<<1<<' '<<a[i]/i<<endl;
        }
        rep(i,2,n+1) cout<<1<<' '<<i<<' '<<sum<<endl;
    }

}
int main(){
    IOS;
    int t;cin>>t;
    while(t--){
        solve();
    }
    return 0;
}