import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    }

    static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
} import java.io.BufferedReader; BufferedReader java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.InputStreamReader; InputStreamReader java.io import java.io.OutputStream; OutputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Arrays; Arrays java.util import java.util.StringTokenizer; StringTokenizer java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    }

    static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out InputReader in = new InputReader(inputStream); in new InputReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) Task solver = new Task(); solver new Task() solver.solve(in, out) solver.solve solver in out out.close() out.close out String[] args args static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    } Task int N N ans = 0; ans 0 Integer[] d; d void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        } solve {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        } N = in.nextInt() N in.nextInt() in.nextInt in d = new Integer[N] d new Integer[N] N for (int i = 0; i < N; ++i) d[i] = in.nextInt(); int i = 0; int i = 0; i 0 i < N i N ++i ++i i d[i] = in.nextInt(); d[i] = in.nextInt() d[i] d i in.nextInt() in.nextInt in Arrays.sort(d) Arrays.sort Arrays d for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            } int i = 1; int i = 1; i 1 i <= d[d.length - 1] i d[d.length - 1] d d.length - 1 d.length d d.length 1 ++i ++i i {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            } {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            } if (Bisect.lowerBound(i, d) == N / 2) ans++; Bisect.lowerBound(i, d) == N / 2 Bisect.lowerBound(i, d) Bisect.lowerBound Bisect i d N / 2 N 2 ans++ ans out.println(ans) out.println out ans InputReader in in PrintWriter out out static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    } Bisect static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        } lowerBound {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        } int low = 0 low 0 high = arr.length; high arr.length arr arr.length while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            } low < high - 1 low high - 1 high 1 {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            } int mid = (low + high) / 2; mid (low + high) / 2 (low + high) low high 2 if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                } x <= arr[mid] x arr[mid] arr mid {
                    high = mid;
                } high = mid high mid if (x > arr[mid]) {
                    low = mid;
                } x > arr[mid] x arr[mid] arr mid {
                    low = mid;
                } low = mid low mid return arr[low] < x ? high : low; arr[low] < x ? high : low arr[low] < x arr[low] arr low x high low int x x Integer[] arr arr static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        } higherBound {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        } int low = 0 low 0 high = arr.length; high arr.length arr arr.length while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            } low < high - 1 low high - 1 high 1 {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            } int mid = (low + high) / 2; mid (low + high) / 2 (low + high) low high 2 if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                } x < arr[mid] x arr[mid] arr mid {
                    high = mid;
                } high = mid high mid if (x >= arr[mid]) {
                    low = mid;
                } x >= arr[mid] x arr[mid] arr mid {
                    low = mid;
                } low = mid low mid return arr[high] > x ? low : high; arr[high] > x ? low : high arr[high] > x arr[high] arr high x low high int x x Integer[] arr arr static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    } InputReader BufferedReader reader; reader StringTokenizer tokenizer; tokenizer InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        } InputReader {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        } reader = new BufferedReader(new InputStreamReader(stream)) reader new BufferedReader(new InputStreamReader(stream)) tokenizer = null tokenizer null InputStream stream stream String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } next {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } tokenizer == null || !tokenizer.hasMoreTokens() tokenizer == null tokenizer null !tokenizer.hasMoreTokens() tokenizer.hasMoreTokens() tokenizer.hasMoreTokens tokenizer {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } IOException e {
                    throw new RuntimeException(e);
                } throw new RuntimeException(e); new RuntimeException(e) {
                    tokenizer = new StringTokenizer(reader.readLine());
                } tokenizer = new StringTokenizer(reader.readLine()) tokenizer new StringTokenizer(reader.readLine()) return tokenizer.nextToken(); tokenizer.nextToken() tokenizer.nextToken tokenizer int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        } nextIntArray {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        } int[] arr = new int[size]; arr new int[size] size for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            } int i = 0; int i = 0; i 0 i < size i size i++ i++ i {
                arr[i] = nextInt();
            } {
                arr[i] = nextInt();
            } arr[i] = nextInt() arr[i] arr i nextInt() nextInt return arr; arr int size size long nextLong() {
            return Long.parseLong(next());
        } nextLong {
            return Long.parseLong(next());
        } return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        } nextLongArray {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        } long[] arr = new long[size]; arr new long[size] size for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            } int i = 0; int i = 0; i 0 i < size i size i++ i++ i {
                arr[i] = nextLong();
            } {
                arr[i] = nextLong();
            } arr[i] = nextLong() arr[i] arr i nextLong() nextLong return arr; arr int size size public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    }

    static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    }

    static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
} Main
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    static class Task {
        int N, ans = 0;
        Integer[] d;

        void solve(InputReader in, PrintWriter out) {
            N = in.nextInt();
            d = new Integer[N];
            for (int i = 0; i < N; ++i) d[i] = in.nextInt();
            Arrays.sort(d);
            for (int i = 1; i <= d[d.length - 1]; ++i) {
                if (Bisect.lowerBound(i, d) == N / 2) ans++;
            }
            out.println(ans);
        }
    }

    static class Bisect {
        static int lowerBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x <= arr[mid]) {
                    high = mid;
                } else if (x > arr[mid]) {
                    low = mid;
                }
            }
            return arr[low] < x ? high : low;
        }

        static int higherBound(int x, Integer[] arr) {
            int low = 0, high = arr.length;
            while (low < high - 1) {
                int mid = (low + high) / 2;
                if (x < arr[mid]) {
                    high = mid;
                } else if (x >= arr[mid]) {
                    low = mid;
                }
            }
            return arr[high] > x ? low : high;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int size) {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int size) {
            long[] arr = new long[size];
            for (int i = 0; i < size; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
}