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

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

    static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.StringTokenizer; StringTokenizer java.util import java.io.BufferedReader; BufferedReader java.io import java.io.FileReader; FileReader java.io import java.io.InputStreamReader; InputStreamReader java.io import java.io.InputStream; InputStream java.io public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskC solver = new TaskC(); solver new TaskC() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    } TaskC public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        } solve {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        } int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int mask = 0; mask 0 boolean ok = false; ok false int num = 0; num 0 while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            } n-- > 0 n-- n 0 {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            } int rating = sc.nextInt(); rating sc.nextInt() sc.nextInt sc if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 1 && rating <= 399 rating >= 1 rating 1 rating <= 399 rating 399 {
                    mask |= 1;
                } mask |= 1 mask 1 if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 400 && rating <= 799 rating >= 400 rating 400 rating <= 799 rating 799 {
                    mask |= 2;
                } mask |= 2 mask 2 if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 800 && rating <= 1199 rating >= 800 rating 800 rating <= 1199 rating 1199 {
                    mask |= 4;
                } mask |= 4 mask 4 if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 1200 && rating <= 1599 rating >= 1200 rating 1200 rating <= 1599 rating 1599 {
                    mask |= 8;
                } mask |= 8 mask 8 if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 1600 && rating <= 1999 rating >= 1600 rating 1600 rating <= 1999 rating 1999 {
                    mask |= 16;
                } mask |= 16 mask 16 if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 2000 && rating <= 2399 rating >= 2000 rating 2000 rating <= 2399 rating 2399 {
                    mask |= 32;
                } mask |= 32 mask 32 if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 2400 && rating <= 2799 rating >= 2400 rating 2400 rating <= 2799 rating 2799 {
                    mask |= 64;
                } mask |= 64 mask 64 if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                } rating >= 2800 && rating <= 3199 rating >= 2800 rating 2800 rating <= 3199 rating 3199 {
                    mask |= 128;
                } mask |= 128 mask 128 {
                    num++;
                    ok = true;
                } num++ num ok = true ok true int res = 0; res 0 for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++; int i = 0; int i = 0; i 0 i <= 7 i 7 i++ i++ i if ((mask & (1 << i)) != 0) res++; if ((mask & (1 << i)) != 0) res++; (mask & (1 << i)) != 0 (mask & (1 << i)) mask (1 << i) 1 i 0 res++ res out.print(ok ? Math.max(1, res) : res) out.print out ok ? Math.max(1, res) : res ok Math.max(1, res) Math.max Math 1 res res out.println(" " + (res + num)) out.println out " " + (res + num) " " (res + num) res num int testNumber testNumber Scanner sc sc PrintWriter out out static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

    } Scanner StringTokenizer st; st BufferedReader br; br public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        } Scanner {
            br = new BufferedReader(new InputStreamReader(s));
        } br = new BufferedReader(new InputStreamReader(s)) br new BufferedReader(new InputStreamReader(s)) InputStream s s public Scanner(FileReader f) {
            br = new BufferedReader(f);
        } Scanner {
            br = new BufferedReader(f);
        } br = new BufferedReader(f) br new BufferedReader(f) FileReader f f public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        } next {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        } while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                } st == null || !st.hasMoreTokens() st == null st null !st.hasMoreTokens() st.hasMoreTokens() st.hasMoreTokens st try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                } catch (Exception e) {
                } Exception e {
                } {
                    st = new StringTokenizer(br.readLine());
                } st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

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

    static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class TaskC {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            int mask = 0;
            boolean ok = false;
            int num = 0;
            while (n-- > 0) {
                int rating = sc.nextInt();
                if (rating >= 1 && rating <= 399) {
                    mask |= 1;
                } else if (rating >= 400 && rating <= 799) {
                    mask |= 2;
                } else if (rating >= 800 && rating <= 1199) {
                    mask |= 4;
                } else if (rating >= 1200 && rating <= 1599) {
                    mask |= 8;
                } else if (rating >= 1600 && rating <= 1999) {
                    mask |= 16;
                } else if (rating >= 2000 && rating <= 2399) {
                    mask |= 32;
                } else if (rating >= 2400 && rating <= 2799) {
                    mask |= 64;
                } else if (rating >= 2800 && rating <= 3199) {
                    mask |= 128;
                } else {
                    num++;
                    ok = true;
                }
            }
            int res = 0;
            for (int i = 0; i <= 7; i++)
                if ((mask & (1 << i)) != 0) res++;
            out.print(ok ? Math.max(1, res) : res);
            out.println(" " + (res + num));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

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

    }
}

