// I wanna win
#define B5F
#define B5E
#define B5D printf("%lld
", MIN << 1);
#define B5C __TEMP_READ_VALUE;
#define B5B function<void(tp,
#define B5A function<tp(tp)>
#define B59 __Initer_t()
#define B58 min(miny[x],
#define B57 max(maxx[x],
#define B56 min(minx[x],
#define B55 max(maxy[x],
#define B54 find(f[x]);
#define B53 __Initer_t
#define B52 array<tp,
#define B51 miny[y]);
#define B50 miny[i]);
#define B4F minx[y]);
#define B4E maxy[y]);
#define B4D maxx[y]);
#define B4C namespace
#define B4B __Initer;
#define B4A find(y);
#define B49 link(ra,
#define B48 (find(i)
#define B47 min(MIN,
#define B46 find(x);
#define B45 100003>
#define B44 maxy[x]
#define B43 miny[x]
#define B42 minx[x]
#define B41 miny[i]
#define B40 typedef
#define B3F maxx[i]
#define B3E maxx[x]
#define B3D minx[i]
#define B3C maxy[i]
#define B3B [&](tp
#define B3A struct
#define B39 signed
#define B38 return
#define B37 main()
#define B36 maxy;
#define B35 miny,
#define B34 using
#define B33 while
#define B32 -1ull
#define B31 maxx,
#define B30 minx,
#define B2F (m--)
#define B2E tp)>
#define B2D ++i)
#define B2C f[x]
#define B2B ra);
#define B2A long
#define B29 std;
#define B28 f[y]
#define B27 find
#define B26 f[i]
#define B25 void
#define B24 link
#define B23 (tp
#define B22 MIN
#define B21 for
#define B20 ra;
#define B1F ra,
#define B1E tp;
#define B1D ==
#define B1C >>
#define B1B f,
#define B1A i;
#define B19 i)
#define B18 n;
#define B17 0;
#define B16 tp
#define B15 ->
#define B14 1;
#define B13 if
#define B12 2;
#define B11 <=
#define B10 };
#define BF x)
#define BE x,
#define BD x;
#define BC y)
#define BB ?
#define BA m
#define B9 =
#define B8 -
#define B7 i
#define B6 +
#define B5 n
#define B4 y
#define B3 :
#define B2 {
#define B1 }
#define B0 x
#pragma region HEAD
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <utility>
#include <vector>
#ifdef ___RB_DEBUG___
#include "rb_debug.h"
#else
#define dbg(...)
#endif
#define ra (scanf("%lld", &__TEMP_READ_VALUE), __TEMP_READ_VALUE)
#define LIKELY(exp) __builtin_expect(bool(exp), 1)
#define UNLIKELY(exp) __builtin_expect(bool(exp), 0)
#define B60 B40 B2A B2A B1E B16 B5C B34 B4C B29 
#define B61(__FOX__) __FOX__
B61(B60)
#pragma endregion HEAD
#define B62 B39 B37 B2 B16 B5 B9 B1F BA B9 B1F
#define B63 B22 B9 B32 B1C B12 B52 B45 B1B B30 B35
#define B64 B31 B36 B5A B27 B9 B3B BF B15 B16 B2
#define B65 B38 B2C B1D B0 BB B0 B3 B2C B9 B54
#define B66 B10 B5B B2E B24 B9 B3B BE B16 BC B15
#define B67 B25 B2 B0 B9 B46 B4 B9 B4A B42 B9
#define B68 B56 B4F B43 B9 B58 B51 B3E B9 B57 B4D
#define B69 B44 B9 B55 B4E B28 B9 BD B10 B21 B23
#define B6A B7 B9 B14 B7 B11 B18 B2D B2 B3D B9
#define B6B B3F B9 B20 B41 B9 B3C B9 B20 B26 B9
#define B6C B1A B1 B33 B2F B2 B49 B2B B1 B21 B23
#define B6D B7 B9 B14 B7 B11 B18 B2D B2 B13 B48
#define B6E B1D B19 B2 B22 B9 B47 B3F B8 B3D B6
#define B6F B3C B8 B50 B1 B1 B5D B38 B17 B1 B3A
#define B70 B53 B2 B59 B2 B5E B5F B1 B1 B4B 
#define B71 B62 B63 B64 B65 B66 B67 B68 B69 B6A B6B
#define B72 B6C B6D B6E B6F B70 
#define B73 B71 B72 
#define B74(__FOX__) __FOX__
B74(B73)