// May this submission get accepted! #pragma GCC optimize ("O3") #pragma GCC target ("tune=native") #pragma GCC target ("avx") #include // 汎用マクロ #define ALL_OF(x) (x).begin(), (x).end() #define REP(i,n) for (long long i=0, i##_len=(n); i=i##_end; i--) #define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step) #define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false) template bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; } template bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; } #define INF 0x7FFFFFFF #define LINF 0x7FFFFFFFFFFFFFFFLL #define Yes(q) ((q) ? "Yes" : "No") #define YES(q) ((q) ? "YES" : "NO") #define Possible(q) ((q) ? "Possible" : "Impossible") #define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE") #define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl #define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(i, (q).size()) { cerr << (q)[i] << (i == i_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false) template T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; } template T lcm(const T a, const T b) { return a / gcd(a, b) * b; } // gcc拡張マクロ #define popcount __builtin_popcount #define popcountll __builtin_popcountll // エイリアス #define DANCE_ long #define ROBOT_ unsigned #define HUMAN_ signed #define CHOKUDAI_ const using ll = DANCE_ HUMAN_ DANCE_; using ull = DANCE_ ROBOT_ DANCE_; using cll = DANCE_ DANCE_ CHOKUDAI_; using ld = long double; using namespace std; // モジュール // 処理内容 int main() { // インタラクティブ問題では除去した方がいいかも ios::sync_with_stdio(false); cin.tie(nullptr); ll n; cin >> n; vector x(n), y(n); REP(i, n) cin >> x[i]; REP(i, n) cin >> y[i]; ll ans = LINF; REP(i, n) { chmin(ans, x[i] + y[i]); } cout << ans << endl; cout << 0 << endl; REP(i, n) { cout << min(ans, x[i]) << endl; } cout << ans << endl; }