#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[200001],prefix[200001];
vector<ll> adj[100001];
void solve()
{
     ll i,j,k,l,m,n,o,p,q,r;
     cin>>n;
    
     //cout<<adj[10000].size()<<endl;
     vector<pair<ll,ll>> vp;
     for(i=0;i<n;i++)
     {
         cin>>a[i];
         if(i>=1)
         {
             ll x,y;
             o=-a[i];
             p=abs(o);
             if(p%n==0)
             {
                 if(o>0)
                 vp.push_back({-1*p/n,0});
                 else 
                 vp.push_back({p/n,0});
             }
             else 
             {
                 k=p/n;
                 k++;
                 q=k*n;
                 if(o>0)
                 {
                     y=q-o;
                     x=k-y;
                     vp.push_back({-1*x,-1*y});
                 }
                 else 
                 {
                     k--;
                     q=-1*k;
                     q*=n;
                     y=o-q;
                     x=k-y;
                     vp.push_back({x,y});
                 }
             }
         }
        
     }
     cout<<1<<" "<<n<<endl;
     for(i=0;i<n;i++)
     {
         if(i==0)
         {
             cout<<n<<" ";
             a[0]+=n;
         }
         else 
         {
             cout<<vp[i-1].first*(-1*n)<<" ";
         }
     }
     cout<<endl;
     cout<<2<<" "<<n<<endl;
     for(i=0;i<n;i++)
     {
         if(i==0)
         {
            
         }
         else 
         {
             cout<<vp[i-1].second*(-1*(n-1))<<" ";
         }
     }
     cout<<endl;
     cout<<1<<" "<<1<<endl;
     cout<<-1*a[0]<<endl;

}
int main()
{
     ios_base::sync_with_stdio(false);
     cin.tie(0);
     ll t=1;
     //cin>>t;
     while(t--)
     {
         solve();
     }
    return 0;
}