#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long sum = 0, ans = 0;
map<long long, long long> m;
vector<long long> v, v2;
void block(long long x) {
  while (x > 0) {
    v.push_back(x % 2);
    x = x / 2;
  }
  for (int i = 0; i < v.size(); i++) {
    if (v[i] == 1) {
      v2.push_back(i);
    }
  }
}
bool is(long long n) { return (ceil(log2(n)) == floor(log2(n))); }
bool q(const pair<long long, long long> &a,
       const pair<long long, long long> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
bool q2(const pair<long long, long long> &a,
        const pair<long long, long long> &b) {
  if (a.first == b.first) return a.second > b.second;
  return a.first > b.first;
}
long long po(long long x, long long y) {
  long long temp;
  if (y == 0) return 1;
  temp = po(x, y / 2);
  if (y % 2 == 0)
    return (temp * temp) % mod;
  else
    return (x * temp * temp) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t = 1, n, k, m, mx = -1, mn = INT_MAX, y, b, r, ans = 0, last = 0,
            d = 0;
  string s, s2 = "";
  while (t--) {
    cin >> s;
    n = s.size();
    bool flag = false;
    for (int i = 0; i < n; i++) {
      if (!flag && s[i] == '0') {
        flag = true;
        continue;
      }
      s2 += s[i];
    }
    if (flag)
      cout << s2;
    else
      cout << s2.substr(0, n - 1);
  }
  return 0;
}
