#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VB = vector<bool>;
using VD = vector<long double>;
using VC = vector<char>;
using VS = vector<string>;
using V2I = vector<VI>;
using V3I = vector<V2I>;
const ll mod{(ll)1e9 + 7};
const long double pi = 2 * acos(0.0);
void solve() {
  ll n;
  cin >> n;
  VI vec(n);
  for (ll &x : vec) cin >> x;
  if (n == 1) {
    cout << 1 << ' ' << 1 << '\n';
    cout << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n';
    cout << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n';
    cout << -vec[0];
    return;
  }
  map<ll, ll> mp;
  for (ll i{}, j{n - 1}; i < n; i++, j += n - 1) mp[j % n] = j;
  cout << 1 << ' ' << n - 1 << '\n';
  for (ll i{}; i < n - 1; i++) {
    if (vec[i] < 0) {
      ll tem{mp[n - -vec[i] % n]};
      tem = -tem;
      cout << tem << ' ';
      vec[i] += tem;
    } else {
      ll tem{mp[n - vec[i] % n]};
      cout << tem << ' ';
      vec[i] += tem;
    }
  }
  cout << '\n' << n << ' ' << n << '\n';
  if (vec[n - 1] < 0) {
    cout << -mp[n - -vec[n - 1] % n] << '\n';
    vec[n - 1] -= mp[n - -vec[n - 1] % n];
  } else {
    cout << mp[n - vec[n - 1] % n] << '\n';
    vec[n - 1] += mp[n - vec[n - 1] % n];
  }
  cout << 1 << ' ' << n << '\n';
  for (ll i{}; i < n; i++) {
    cout << -vec[i] << ' ';
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
