#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vectora(n), b(n); rep(i, n) { a[i] = i * 3; b[i] = i * 3 + 7; } if (1 == n % 3) { a[0]++; } else if (2 == n % 3) { a[0]++; a[1]++; } int diff = 0; rep(i, n)diff += b[i] - a[i]; int last = 9999; rrep(i, n) { if (0 == diff)break; long long x = min(diff, ((last - a[i]) / 3) * 3); diff -= x; a[i] += x; last = a[i]; } rep(i, n)cout << a[i] << " "; cout << endl; rep(i, n)cout << b[i] << " "; cout << endl; return 0; }