#include <bits/stdc++.h>
using namespace std;
const double pi = 3.1415926535897;
int stoi1(string op) {
  int i;
  stringstream s_str(op);
  s_str >> i;
  return i;
}
string to_stringe(int number) {
  stringstream ss;
  ss << number;
  return ss.str();
}
int dp_fib[1001];
int fact_memoization(int n) {
  if (n <= 1) return 1;
  if (dp_fib[n] != -1) return dp_fib[n];
  return dp_fib[n] = fact_memoization(n - 2) + fact_memoization(n - 1);
}
int fact_bottomUp_dp(int n) {
  int arr[1000001];
  arr[0] = arr[1] = 1;
  for (int i = 2; i <= n; i++) arr[i] = arr[i - 2] + arr[i - 1];
  return arr[n];
}
int main() {
  string bin;
  cin >> bin;
  long long arr[100001];
  arr[0] = 1;
  int SZ = bin.length();
  if (bin[bin.length() - 1] == 0) {
    for (int i = 0; i < SZ - 1; i++) {
      cout << bin[i];
    }
    return 0;
  }
  int idx = -1;
  int t = 0;
  for (int i = 0; i < SZ; i++) {
    if (bin[i] == '0' && !t) {
      idx = i;
      t++;
    }
  }
  if (idx == -1)
    for (int i = 0; i < SZ - 1; i++) cout << bin[i];
  else
    for (int i = 0; i < SZ; i++) {
      if (i == idx) continue;
      cout << bin[i];
    }
  return 0;
}
