func_code_string: #include <bits/stdc++.h>   using namespace std;   long long M1 = 998244353;   long long M2 = 1000000007;   long long fact[100005];   long long prime[169] = {       2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,  41,  43,  47,       53,  59,  61,  67,  71,  73,  79,  83,  89,  97,  101, 103, 107, 109, 113,       127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197,       199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,       283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379,       383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,       467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571,       577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,       661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761,       769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863,       877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977,       983, 991, 997, 1009};   long long gcd(long long a, long long b) {     while (a != 0 && b != 0) {       if (a > b)         a %= b;       else         b %= a;     }     return max(a, b);   }   long long power(long long a, long long b, long long m) {     long long ans = 1;     while (b) {       if (b & 1) ans = (ans * a) % m;       b /= 2;       a = (a * a) % m;     }     return ans;   }   long long modInverse(long long a, long long m) {     long long g = gcd(a, m);     if (g == 1) return power(a, m - 2, m);   }   long long ncr(long long n, long long r, long long m) {     if (r == 0) return 1;     return (fact[n] * modInverse(fact[r], m) % m * modInverse(fact[n - r], m) %             m) %            m;   }   void boost() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);   }   int main() {     boost();     long long n, i, j, add = 0, t1, t2, m;     cin >> n;     long long a[n + 1], x = n + 1;     for (i = 1; i < n + 1; i++) cin >> a[i];     vector<pair<long long, pair<long long, long long>>> vec;     for (i = n; i >= 1; i--) {       m = (a[i] + add) % x;       if (m == i)         continue;       else if (m < i) {         t1 = i - m;         add += t1;         vec.push_back({1, {i, t1}});       } else {         t1 = x - m + i;         add += t1;         vec.push_back({1, {i, t1}});       }     }     vec.push_back({2, {n, x}});     long long ans = vec.size();     cout << ans << endl;     for (i = 0; i < ans; i++)       cout << vec[i].first <<     << vec[i].second.first <<                << vec[i].second.second << endl;   }   