Gaby And Addition Gym - 101466A （初学字典树）

Gaby is a little baby who loves playing with numbers. Recently she has learned how to add 2 numbers using the standard addition algorithm which we summarize in 3 steps:

1. Line up the numbers vertically matching digits places.
2. Add together the numbers that share the same place value from right to left.
3. Carry if necessary.

it means when adding two numbers we will get something like this:

Unfortunately as Gaby is too young she doesn't know what the third step means so she just omitted this step using her own standard algorithm (Gaby's addition algorithm). When adding two numbers without carrying when necessary she gets something like the following:

Gaby loves playing with numbers so she wants to practice the algorithm she has just learned (in the way she learned it) with a list of numbers adding every possible pair looking for the pair which generates the largest value and the smallest one.

She needs to check if she is doing it correctly so she asks for your help to find the largest and the smallest value generated from the list of numbers using Gaby's addition algorithm.

Input

The input starts with an integer n (2 ≤ n ≤ 10⁶) indicating the number of integers Gaby will be playing with. The next line contains n numbers n_i (0 ≤ n_i ≤ 10¹⁸) separated by a single space.

Output

Output the smallest and the largest number you can get from adding two numbers from the list using Gaby's addition algorithm.

Examples

Input

6
17 5 11 0 42 99

Output

0 99

Input

7
506823119072235413 991096248449924896 204242310783332529 778958050378192979 384042493592684633 942496553147499866 410043616343857825

Output

52990443860776502 972190360051424498

Note

In the first sample input this is how you get the minimum and the maximum value

这题也是被安排的明明白白  组队训练的时候这题不会做

后面说是字典树 学了2个小时字典树还是没写出来

心态蹦了

现学字典树

 #include <bits/stdc++.h>
 #define  pi acos(-1.0)
 #define  eps 1e-6
 #define  fi first
 #define  se second
 #define  lson l,m,rt<<1
 #define  rson m+1,r,rt<<1|1
 #define  bug         printf("******\n")
 #define  mem(a,b)    memset(a,b,sizeof(a))
 #define  fuck(x)     cout<<"["<<x<<"]"<<endl
 #define  f(a)        a*a
 #define  sf(n)       scanf("%d", &n)
 #define  sff(a,b)    scanf("%d %d", &a, &b)
 #define  sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
 #define  sffff(a,b,c,d) scanf("%d %d %d %d", &a, &b, &c, &d)
 #define  pf          printf
 #define  FIN         freopen("DATA.txt","r",stdin)
 #define  gcd(a,b)    __gcd(a,b)
 #define  lowbit(x)   x&-x
 #pragma  comment (linker,"/STACK:102400000,102400000")
 using namespace std;
 typedef long long LL;
 typedef unsigned long long ULL;
 const int INF = 0x7fffffff;
 const LL LLINF = 0x3f3f3f3f3f3f3f3fll;
 const int maxn = 1e6 + ;
 const int mod = 1e9 + ;
 LL t[], a[maxn];
 struct trie {
     int cnt[maxn * ], tree[maxn * ][], arr[], root, rear;
     int newnode() {
         cnt[++rear] = ;
         mem(tree[rear], );
         return rear;
     }
     void init() {
         rear = ;
         root = newnode();
     }
     void add(LL x) {
         int now = root, temp;
         for (int i =  ; i <  ; i++) arr[i] = x % , x /= ;
         for (int i =  ; i >=  ; i--) {
             temp = arr[i];
             if (!tree[now][temp]) tree[now][temp] = newnode();
             now = tree[now][temp];
             cnt[now]++;
         }
     }
     LL query1(LL x) {
         int now = root, maxx, idx;
         LL ret = ;
         for (int i =  ; i <  ; i++) arr[i] = x % , x /= ;
         for (int i =  ; i >=  ; i--) {
             maxx = -, idx = -;
             for (int j =  ; j <  ; j++)
                 if (tree[now][j] && (arr[i] + j) %  > maxx) maxx = (arr[i] + j) % , idx = j;
             ret += t[i] * maxx;
             now = tree[now][idx];
         }
         return ret;
     }
     LL query2(LL x) {
         int now = root, maxx, idx;
         LL ret = ;
         for (int i =  ; i <  ; i++) arr[i] = x % , x /= ;
         for (int i =  ; i >=  ; i--) {
             maxx = , idx = -;
             for (int j =  ; j <  ; j++)
                 if (tree[now][j] && (arr[i] + j) %  < maxx  )  maxx = (arr[i] + j) % , idx = j;
             ret += t[i] * maxx;
             now = tree[now][idx];
         }
         return ret;
     }
 } tr;
 int main() {
     t[] = ;
     for (int i =  ; i <  ; i++) t[i] = t[i - ] * ;
     int n;
     sf(n);
     LL ans1 = (1LL) << , ans2 = ;
     tr.init();
     for (int i =  ; i < n ; i++) {
         scanf("%lld", &a[i]);
         if (i) {
             ans1 = min(ans1, tr.query2(a[i]));
             ans2 = max(ans2, tr.query1(a[i]));
         }
         tr.add(a[i]);
     }
     printf("%lld %lld\n", ans1, ans2);
     return ;
 }