#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return a % b ? gcd(b, a % b) : b; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
pair<int, int> vu[8] = {{0, 1},  {1, 0},  {0, -1}, {-1, 0},
                        {1, -1}, {-1, 1}, {0, 1},  {1, 0}};
const int max_v = 1e5 + 7;
const int INF = 1e18 + 7;
const int mod = 1e9 + 7;
long long arr[max_v];
int n;
long long f(long long idx) {
  long long ret = ((idx % n) + (n - 1)) % n;
  return (1 + ret) * (n - 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i < n + 1; ++i) cin >> arr[i];
  cout << "1 1\n" << -1 * arr[1] << "\n";
  if (n == 1) {
    cout << "1 1\n0\n";
    cout << "1 1\n0";
    return 0;
  }
  arr[1] = 0;
  cout << "2 " << n << "\n";
  for (int i = 2; i < n + 1; ++i) {
    long long t = f(arr[i]);
    arr[i] += t;
    cout << t << " ";
  }
  cout << "\n";
  cout << "1 " << n << "\n";
  for (int i = 1; i < n + 1; ++i) cout << arr[i] * -1 << " ";
  return 0;
}
