The Little Elephant has an integer a, written in the binary notation. He wants to write this number on a piece of paper.

To make sure that the number a fits on the piece of paper, the Little Elephant ought to delete exactly one any digit from number a in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes).

The Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.

Input

The single line contains integer a, written in the binary notation without leading zeroes. This number contains more than 1 and at most 105 digits.

Output

In the single line print the number that is written without leading zeroes in the binary notation — the answer to the problem.

Examples

Input

101


Output

11


Input

110010


Output

11010

Note

In the first sample the best strategy is to delete the second digit. That results in number 112 = 310.

In the second sample the best strategy is to delete the third or fourth digits — that results in number 110102 = 2610.
//package com.company;

import java.util.*;
import java.io.*;
import java.lang.*;

public class Main {
    public static int maxOf3(int x, int y, int z) {
        return Math.max(x, Math.max(y, z));
    }

    public static int minof3(int x, int y, int z) {
        return Math.min(x, Math.min(y, z));
    }

    public static long maxOf3(long x, long y, long z) {
        return Math.max(x, Math.max(y, z));
    }

    public static long minof3(long x, long y, long z) {
        return Math.min(x, Math.min(y, z));
    }

    public static void arrInput(int[] arr, int n) {
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextInt();
    }

    public static void arrInput(long[] arr, int n) {
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextLong();
    }

    public static int maxarrInput(int[] arr, int n) {
        int max = 0;
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
            max = Math.max(max, arr[i]);
        }
        return max;

    }

    public static long maxarrInput(long[] arr, int n) {
        long max = 0;
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextLong();
            max = Math.max(max, arr[i]);
        }
        return max;
    }

    public static int minarrInput(int[] arr, int n) {
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
            min = Math.max(min, arr[i]);
        }
        return min;
    }

    public static long minarrInput(long[] arr, int n) {
        long min = 0;
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextLong();
            min = Math.max(min, arr[i]);
        }
        return min;
    }

    public static long sumofarr(int[] arr) {
        long sum = 0;
        for (int i : arr)
            sum += i;
        return sum;
    }

    public static long sumofarr(long[] arr) {
        long sum = 0;
        for (long i : arr)
            sum += i;
        return sum;
    }

    public static int lowerBound(int[] arr, int x) {
        int l = -1, r = arr.length;
        while (l + 1 < r) {
            int m = (l + r) >>> 1;
            if (arr[m] >= x) r = m;
            else l = m;
        }
        return r;
    }

    public static int upperBound(int[] arr, int x) {
        int l = -1, r = arr.length;
        while (l + 1 < r) {
            int m = (l + r) >>> 1;
            if (arr[m] <= x) l = m;
            else r = m;
        }
        return l + 1;
    }

    public static long maxofarr(long[] arr) {
        long max = 0;
        for (long i : arr)
            max = Math.max(i, max);
        return max;
    }

    public static long minofarr(long[] arr) {
        long min = Integer.MAX_VALUE;
        for (long i : arr)
            min = Math.min(min, i);
        return min;
    }

    public static int maxofarr(int[] arr) {
        int max = 0;
        for (int i : arr)
            max = Math.max(i, max);
        return max;
    }

    public static int minofarr(int[] arr) {
        int min = Integer.MAX_VALUE;
        for (int i : arr)
            min = Math.min(min, i);
        return min;
    }

    public static long mod = (long) (1e9 + 7);
    public static FastReader sc = new FastReader();
    public static PrintWriter out = new PrintWriter(System.out);

    //******************************--SOLUTION--******************************


    public static void main(String[] args) {
//        try {


        String s = sc.next();
        int t = -1;
        for (int i = 0; i < s.length(); i++)
            if ('0' == s.charAt(i)) {
                t = i;
                break;
            }
        if(t==-1)out.println(s.substring(1));
        else out.println(s.substring(0,t)+s.substring(t+1));

        out.flush();
//        } catch (Exception ignored) {
//        }
    }
}

//******************************************************

class Pair {
    int first, second;

    Pair(int x, int y) {
        this.first = x;
        this.second = y;
    }
}

class FastReader {
    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    public String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                System.out.println(e);
            }
        }
        return st.nextToken();
    }

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

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

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

    public String nextLing() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            System.out.println(e);
        }
        return str;
    }
}