#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using vec = vector<T>;
template <typename T>
using Prior = priority_queue<T>;
template <typename T>
using prior = priority_queue<T, vec<T>, greater<T>>;
const int INF = 1e9 + 1;
const ll LLINF = (ll)4 * 1e18;
const ll MOD = 1e9 + 7;
const double PI = 3.14159265358;
const double EPS = 1e-8;
const int xx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int yy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
template <typename T, typename... Args>
void debug(T a, Args... args) {
  cout << "# " << a;
  ((cout << ", " << args), ..., (cout << '\n'));
}
template <typename T>
void printv(vec<T> v, char c = ' ') {
  bool spc = false;
  for (auto i : v)
    if (spc)
      cout << c << i;
    else
      cout << i, spc = true;
  cout << '\n';
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void mmod(ll &a, ll b) { a = (a - b + MOD) % MOD; }
void tmod(ll &a, ll b) { a = (a * b) % MOD; }
void UNI(vec<int> &v) {
  sort(v.begin(), v.end());
  v.resize(unique(v.begin(), v.end()) - v.begin());
}
ll POW(ll a, ll b) {
  ll res = 1;
  do {
    if (b % 2) tmod(res, a);
    tmod(a, a);
  } while (b >>= 1);
  return res;
}
int getint() {
  int ret;
  cin >> ret;
  return ret;
}
ll getll() {
  ll ret;
  cin >> ret;
  return ret;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
void amax(T &a, T b) {
  if (a < b) a = b;
}
template <typename T>
void amin(T &a, T b) {
  if (a > b) a = b;
}
const int MXN = 100000;
const int N = MXN + 10;
void solve() {
  int n;
  cin >> n;
  vec<ll> v(n);
  for (auto &i : v) cin >> i;
  if (n == 1) {
    cout << 1 << ' ' << 1 << '\n' << 1 << '\n';
    cout << 1 << ' ' << 1 << '\n' << 1 << '\n';
    cout << 1 << ' ' << 1 << '\n' << -v[0] - 2 << '\n';
    return;
  }
  cout << 1 << ' ' << 1 << '\n' << -v[0] << '\n';
  v[0] = 0;
  cout << 2 << ' ' << n << '\n';
  for (int i = 1; i <= (n - 1); i++) cout << v[i] * (n - 1) << ' ';
  cout << '\n';
  cout << 1 << ' ' << n << '\n';
  for (int i = 0; i < (n); i++) cout << -v[i] * n << ' ';
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T = 1;
  while (T--) {
    solve();
  }
}
