#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
void solve() {
  long long n, i, l;
  cin >> n;
  vector<long long> a;
  for (long long i = 0; i < n; i++) {
    cin >> l;
    a.push_back(l);
  }
  cout << 1 << " " << 1 << "\n" << -a[0] << "\n";
  a[0] = 0;
  if (n == 1) {
    for (long long i = 0; i < 2; i++) {
      cout << 1 << " " << 1 << "\n" << 0 << "\n";
    }
  } else {
    cout << 1 << " " << n << "\n";
    for (long long i = 0; i < n; i++) {
      cout << -n * a[i] << " ";
    }
    cout << "\n";
    cout << 2 << " " << n << "\n";
    for (long long i = 1; i < n; i++) {
      cout << (n - 1) * a[i] << " ";
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
