Problem: A positive integer number n is written on a blackboard. It consists of not more than 105 digits. You have to transform it into a beautiful number by erasing some of the digits, and you want to erase as few digits as possible.

The number is called beautiful if it consists of at least one digit, doesn't have leading zeroes and is a multiple of 3. For example, 0, 99, 10110 are beautiful numbers, and 00, 03, 122 are not.

Write a program which for the given n will find a beautiful number such that n can be transformed into this number by erasing as few digits as possible. You can erase an arbitraty set of digits. For example, they don't have to go one after another in the number n.

If it's impossible to obtain a beautiful number, print -1. If there are multiple answers, print any of them.

Input

The first line of input contains n — a positive integer number without leading zeroes (1 ≤ n < 10100000).

Output

Print one number — any beautiful number obtained by erasing as few as possible digits. If there is no answer, print  - 1.

Examples

Input

1033


Output

33


Input

10


Output

0


Input

11


Output

-1

Note

In the first example it is enough to erase only the first digit to obtain a multiple of 3. But if we erase the first digit, then we obtain a number with a leading zero. So the minimum number of digits to be erased is two.

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * @author pttrung
 */
public class C_Edu_Round_18 {

    public static long MOD = 1000000007;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
        PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        String line = in.next();
        int[] count = new int[3];
        int result = 0;
        for (int i = 0; i < line.length(); i++) {
            int v = line.charAt(i) - '0';
            v %= 3;
            result += v;
            result %= 3;
            count[v]++;
        }
        if (result == 0) {
            out.println(line);
        } else {
            String a = cal(result, result, count, line);
            String b = cal(result, 3 - result, count, line);
            // System.out.println(a + " " + b);
            if (!a.equals("-1") && !b.equals("-1")) {
                if (a.length() >= b.length()) {
                    out.println(a);
                }else{
                    out.println(b);
                }
            } else if (!a.equals("-1")) {
                out.println(a);
            } else if (!b.equals("-1")) {
                out.println(b);
            } else {
                out.println(-1);
            }
        }
        out.close();
    }

    public static String cal(int mod, int index, int[] count, String line) {
        if (mod == index) {
            if (count[index] > 0) {
                if (line.length() == 1) {
                    return "-1";
                }
                int st = 0;
                int ed = 0;
                for (int i = line.length() - 1; i >= 0; i--) {
                    int v = line.charAt(i) - '0';
                    v %= 3;
                    if (v == index) {
                        st = i;
                        ed = i + 1;
                        if (st == 0) {
                            while (ed < line.length() && line.charAt(ed) == '0') {
                                ed++;
                            }
                            if (ed == line.length()) {
                                return "0";
                            }
                        }

                        ed--;
                        break;
                    }
                }
                //System.out.println(st + " " + ed);
                StringBuilder builder = new StringBuilder();
                for (int i = 0; i < line.length(); i++) {
                    if (i < st || ed < i) {
                        builder.append(line.charAt(i));
                    }
                }
                return builder.toString();
            } else {
                return "-1";
            }
        } else if (count[index] > 1) {
            if (line.length() == 2) {
                return "-1";
            }
            int first = -1;
            int st = 0;
            int ed = 0;
            for (int i = line.length() - 1; i >= 0; i--) {
                int v = line.charAt(i) - '0';
                v %= 3;
                if (v == index) {
                    if (first == -1) {
                        first = i;
                    } else {
                        st = i;
                        ed = i + 1;
                        if (st == 0) {
                            while (ed < line.length() && (line.charAt(ed) == '0' || ed == first)) {
                                ed++;
                            }
                            if (ed == line.length()) {
                                return "0";
                            }
                        }

                        ed--;
                        break;
                    }
                }
            }
            StringBuilder builder = new StringBuilder();
            for (int i = 0; i < line.length(); i++) {
                if ((i < st || ed < i) && i != first) {
                    builder.append(line.charAt(i));
                }
            }
            return builder.toString();
        } else {
            return "-1";
        }
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return Integer.compare(x, o.x);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

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

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

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}