#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

int used[10]={7,2,6,6,5,6,7,3,6,5};
int main(void){
  int n; cin >> n;
  int d=n/2;
  for(int i=0; i<d; i++){
    for(int j=9; j>=0; j--){
      int nxt=n-used[j];
      int must=2*(d-1-i);
      if(nxt>=must){
        n-=used[j];
        cout << j;
        break;
      }
    }
    if(i==d-1) cout << endl;
  }
  return 0; 
}