Dima worked all day and wrote down on a long paper strip his favorite number n consisting of l digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.

To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive integer without leading zeros. After that he will compute the sum of the two integers and write it down on a new strip.

Dima wants the resulting integer to be as small as possible, because it increases the chances that the sum will fit it in the bookshelf. Help Dima decide what is the minimum sum he can obtain.

Input

The first line contains a single integer l (2 ≤ l ≤ 100 000) — the length of the Dima's favorite number.

The second line contains the positive integer n initially written on the strip: the Dima's favorite number.

The integer n consists of exactly l digits and it does not contain leading zeros. Dima guarantees, that there is at least one valid way to split the strip.

Output

Print a single integer — the smallest number Dima can obtain.

Examples

Input


7
1234567


Output


1801


Input


3
101


Output


11

Note

In the first example Dima can split the number 1234567 into integers 1234 and 567. Their sum is 1801.

In the second example Dima can split the number 101 into integers 10 and 1. Their sum is 11. Note that it is impossible to split the strip into "1" and "01" since the numbers can't start with zeros.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Collections;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jenish
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BSplitANumber solver = new BSplitANumber();
        solver.solve(1, in, out);
        out.close();
    }

    static class BSplitANumber {
        int n;

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            n = in.scanInt();
            int arr[] = new int[n];
            String ss = in.scanString();
            for (int i = 0; i < n; i++) arr[i] = ss.charAt(i) - '0';
            ArrayList<String> ans = new ArrayList<>();
            ArrayList<Integer> valid = new ArrayList<>();
            for (int i = 1; i < n; i++) if (arr[i] != 0 && i >= 1 && n - i >= 1) valid.add(i);
            ArrayList<Integer> cases = new ArrayList<>();
            if (valid.size() < 50) {
                for (int k : valid) cases.add(k);
            } else {
                Collections.sort(valid);
                int mid = valid.size() / 2;
                for (int j = 0; j <= 25; j++) {
                    if (mid + j >= 0 && mid + j < valid.size()) cases.add(valid.get(mid + j));
                    if (mid - j >= 0 && mid - j < valid.size()) cases.add(valid.get(mid - j));
                }

            }


            for (int k : cases) {
                int a[] = new int[k];
                int b[] = new int[n - k];
                int p1 = 0;
                int p2 = 0;
                for (int i = 0; i < n; i++) {
                    if (i < k) {
                        a[p1++] = arr[i];
                    } else {
                        b[p2++] = arr[i];
                    }
                }
                ans.add(sum(a, b));
            }
            Collections.sort(ans);
            String aaa = ans.get(0);
            boolean f = false;
            for (int i = 0; i < aaa.length(); i++) {
                if (aaa.charAt(i) != '0') f = true;
                if (f) out.print(aaa.charAt(i));
            }

        }

        String sum(int arr1[], int arr2[]) {
            int t1[] = new int[n + 10];
            int t2[] = new int[n + 10];
            int ans[] = new int[n + 10];
            int p1 = t1.length - 1;
            int p2 = t1.length - 1;
            for (int i = arr1.length - 1; i >= 0; i--) t1[p1--] = arr1[i];
            for (int i = arr2.length - 1; i >= 0; i--) t2[p2--] = arr2[i];
            int rem = 0;
            for (int i = ans.length - 1; i >= 0; i--) {
                int sum = rem + t1[i] + t2[i];
                if (sum <= 9) {
                    ans[i] = sum;
                    rem = 0;
                } else {
                    ans[i] = sum % 10;
                    rem = (sum / 10);
                }
            }
            StringBuffer sb = new StringBuffer();
            for (int k : ans) {
                sb.append(k);
            }
            return sb.toString();
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public int scanInt() {
            int I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

        public String scanString() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            StringBuilder RESULT = new StringBuilder();
            do {
                RESULT.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return RESULT.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

