#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

const ll n=9;
const ll m=7;

string S[9]={
R"(#######
#.....#
#...|.#
#.....#
#...|.#
#..-..#
#######
)",
R"(#######
#..-..#
#...|.#
#..-..#
#.|...#
#..-..#
#######
)",
R"(#######
#..-..#
#...|.#
#..-..#
#...|.#
#..-..#
#######
)",
R"(#######
#.....#
#.|.|.#
#..-..#
#...|.#
#.....#
#######
)",
R"(#######
#..-..#
#.|...#
#..-..#
#...|.#
#..-..#
#######
)",
R"(#######
#..-..#
#.|...#
#..-..#
#.|.|.#
#..-..#
#######
)",
R"(#######
#..-..#
#...|.#
#.....#
#...|.#
#.....#
#######
)",
R"(#######
#..-..#
#.|.|.#
#..-..#
#.|.|.#
#..-..#
#######
)",
R"(#######
#..-..#
#.|.|.#
#..-..#
#...|.#
#..-..#
#######
)",
};

vector<string> invlr(vector<string> a){
  vector<string> res(m);
  rep(i,m)rep(j,m)res[i]+=a[i][m-1-j];

  return res;
}

vector<string> invud(vector<string> a){
  vector<string> res(m);
  rep(i,m)rep(j,m)res[m-1-i]+=a[i][j];

  return res;
}

vector<string> rot90(vector<string> a){
  vector<string> res(m);
  rep(i,m)rep(j,m)res[i]+=a[i][j];
  rep(i,m)rep(j,m){
    if(a[i][j]=='|')res[m-1-j][i]='-';
    else if(a[i][j]=='-')res[m-1-j][i]='|';
    else res[m-1-j][i]=a[i][j];
  }

  return res;
}

bool issame(const vector<string>& a, const vector<string>& b){
  rep(i,m)rep(j,m)if(a[i]!=b[i])return false;
  return true;
}

vector<ll> getnum(const vector<vector<string>>& bs, const vector<string>& a){
  vector<ll> si={0,7,7,7,7,14};
  vector<ll> sj={7,0,7,14,21,7};

  vector<ll> res;
  rep(h,6){
    vector<string> ext;
    rep(i,m){
      string tmp;
      rep(j,m){
        tmp+=a[si[h]+i][sj[h]+j];
      }
      ext.push_back(tmp);
    }


    if(h%2==0){
      ext=invlr(ext);
    }else if(h==1){
      ext=rot90(ext);
      ext=rot90(ext);
      ext=rot90(ext);
      ext=invlr(ext);
    }else if(h==3){
      ext=rot90(ext);
      ext=invlr(ext);
    }else{
      ext=invlr(ext);
      ext=invud(ext);
    }

    rep(num,n){
      if(issame(ext,bs[num])){
        res.push_back(num+1);
        break;
      }
    }
  }
  return res;
}

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

  vector<vector<string>> bs;
  bs.resize(n);
  rep(i,n){
    string crt=S[i];
    ll idx=0;
    rep(j,7){
      string tmp;
      while(idx<crt.size()&&crt[idx]!='\n'){
        tmp+=crt[idx];
        idx++;
      }
      idx++;
      bs[i].push_back(tmp);
    }
  }

  while(1){
    string input;
    cin>>input;
    if(input=="0")break;
    vector<string> A,B;
    A.push_back(input.substr(0,28));
    B.push_back(input.substr(29,28));
    rep(h,20){
      cin>>input;
      A.push_back(input.substr(0,28));
      B.push_back(input.substr(29,28));
    }
    vector<ll> Anum=getnum(bs,A);
    vector<ll> Bnum=getnum(bs,B);

    ll cnta=0,cntb=0;
    rep(i,6)rep(j,6){
      if(Anum[i]>Bnum[j])cnta++;
      if(Anum[i]<Bnum[j])cntb++;
    }
    if(cnta>=cntb)cout<<"HIGH"<<endl;
    else cout<<"LOW"<<endl;
  }

  return 0;
}

