#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;
typedef queue<int> QI;

int main(){
  int N;
  cin >> N;
  if(N % 2 == 1){
    cout << '7';
    N -= 3;
  }
  REP(i,N/2){
    cout << '1';
  }
  cout << endl;
}