#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-7;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int d8x[8] = {+1, +1, +1, 0, 0, -1, -1, -1};
int d8y[8] = {+1, 0, -1, +1, -1, +1, 0, -1};
int d4x[4] = {1, 0, 0, -1};
int d4y[4] = {0, -1, 1, 0};
long long power(long long x, long long y) {
  long long ans = 1;
  x = x;
  while (y > 0) {
    if (y & 1) ans = (ans * x);
    y = y >> 1;
    x = (x * x);
  }
  return ans;
}
long long sqr(long long x) { return x * x; }
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <class T>
inline void chmax(T &x, T y) {
  x = max((x), (y));
}
template <class T>
inline void chmin(T &x, T y) {
  x = min((x), (y));
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
template <typename T>
T powm(T a, T b, long long m) {
  T cnt = 1;
  while (b > 0) {
    if (b % 2 == 1) cnt = (cnt * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return cnt % m;
}
long long ncr(long long n, long long r) {
  long long ans = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    ans *= (n - i);
    ans /= (i + 1);
  }
  return ans;
}
const int MOD = 1000000007;
const int N = 100010;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n + 5);
  for (long long i = (1); i <= (n); ++i) cin >> a[i];
  if (n == 1) {
    cout << "1 1"
         << "\n";
    cout << -a[1] << "\n";
    cout << "1 1"
         << "\n";
    cout << 0 << "\n";
    cout << "1 1"
         << "\n";
    cout << 0 << "\n";
  } else {
    cout << "1 1"
         << "\n";
    cout << -a[1] << "\n";
    cout << "1 " << n << "\n";
    for (long long i = (1); i <= (n); ++i) {
      if (i == 1)
        cout << 0 << " ";
      else
        cout << -n * a[i] << " ";
    }
    cout << "\n";
    cout << "2 " << n << "\n";
    for (long long i = (2); i <= (n); ++i) cout << (n - 1) * a[i] << " ";
  }
}
int32_t main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  int tc;
  tc = 1;
  for (int i = 1; i <= tc; ++i) solve();
  return 0;
}
