#include <bits/stdc++.h>
using namespace std;
vector<long long> vec[200002];
vector<long long> vec2;
vector<vector<long> > vvv(183);
queue<long> qu;
map<long, long> mp;
map<long, long>::iterator iter;
bool ch[200002] = {false};
long long height[200002] = {0};
queue<pair<int, pair<int, int> > > que;
pair<int, pair<int, int> > pp;
pair<int, int> p;
const int INF = 1000000005;
set<int> myset;
set<int>::iterator it;
int main() {
  string s;
  cin >> s;
  int isfound = 0;
  for (int i = 0; i < s.length(); i++) {
    if (isfound == 1 && s[i] == '0') {
      isfound++;
      continue;
    }
    if (s[i] == '1' && isfound == 0) isfound++;
    if (i == s.length() - 1 && isfound == 1) continue;
    cout << s[i];
  }
  return 0;
}
