#include <bits/stdc++.h>
using namespace std;
struct Point {
  double x, y;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
};
struct Node {
  int value;
  Node* next;
  Node() {}
  Node(int value, Node* next) : value(value), next(next) {}
};
struct Edge {
  int src, dst, weight;
  Edge() {}
  Edge(int src, int dst, int weight) : src(src), dst(dst), weight(weight) {}
};
struct Compare {
  bool operator()(const int i, const int j) { return i > j; }
};
const int DAY[13] = {-1, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dx4[4] = {-1, 0, 1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int>::iterator it, low, up;
pair<vector<int>::iterator, vector<int>::iterator> bound;
Compare comp;
Point p[2];
string s;
int main() {
  if (false) {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
  cin >> s;
  bool first = false;
  int pos = 0;
  int len = s.size();
  if (s[0] == '0') first = true;
  if (first) {
    while (s[pos] == '0') pos++;
    for (int i = pos; i < len; i += 1) cout << s[i];
    cout << endl;
    return 0;
  }
  for (int i = 0; i < len; i += 1) {
    if (s[i] == '0') {
      pos = i;
      break;
    }
  }
  if (pos != -1) {
    for (int i = 0; i < len; i += 1) {
      if (i != pos) cout << s[i];
    }
    cout << endl;
  } else {
    cout << s << endl;
  }
  return 0;
}
