#include <bits/stdc++.h>
using namespace std;
const long long MX = 100000;
const long long MOD = 1000000007;
long long fast_exp(long long base, long long exp, long long mod) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = (res * base) % mod;
    base = (base * base) % mod;
    exp /= 2;
  }
  return res;
}
int lf[MX + 5];
int rt[MX + 5];
char arr[MX + 5];
int main() {
  ios_base::sync_with_stdio(false);
  ;
  scanf("%s", arr + 1);
  int n = strlen(arr + 1);
  lf[0] = rt[n + 1] = 0;
  for (int i = 1; i <= n; i++) lf[i] = (arr[i] - '0') + lf[i - 1];
  for (int i = n; i >= 0; i--) rt[i] = (arr[i] - '0') + rt[i + 1];
  int mx = -1;
  int idx;
  for (int i = 1; i <= n; i++) {
    if (lf[i] - (arr[i] - '0') + rt[i] - (arr[i] - '0') > mx && arr[i] == '0') {
      mx = lf[i] + rt[i] - 2 * (arr[i] - '0');
      idx = i;
    }
  }
  if (mx == -1) {
    if (n == 1)
      printf("0");
    else
      printf("%s", arr + 2);
    return 0;
  } else {
    for (int i = 1; i < idx; i++) printf("%c", arr[i]);
    for (int i = idx + 1; i <= n; i++) printf("%c", arr[i]);
    return 0;
  }
  return 0;
}
