#include <bits/stdc++.h>
using namespace std;
 
int main() {
    string S;
    cin >> S;
    bool a=true;
    if(S.size()%2==1) a=false;
    else for(int i=0;i<S.size()/2;i++){
        if(S.at(i*2)!='h'||S.at(i*2+1)!='i') a=false;
    }
    if(a)cout << "Yes" << endl;
    else cout << "No" << endl;
}

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

using ll = long long;
using P = pair<ll, ll>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }

constexpr int INF = 1e9+5;
constexpr long long INFLL = 1LL<<60;
constexpr double eps = (1e-9);


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  if (n == 0) {
    cout << 0 << endl;
    return 0;
  }

  string ans;
  while (n != 0) {
    if (n % 2 == 0) ans.append("0");  // 後で reverse するので末尾に足す
    else {
      ans.append("1");
      n -= 1;   // 余りを取り除く
    }
    n /= -2;
  }

  reverse(ALL(ans));

  cout << ans << endl;

  return 0;
}
