#include <bits/stdc++.h>
using namespace std;
int mov[3] = {-1, 0, 1};
int main() {
  set<pair<int, int> > m;
  m.insert(make_pair(0, 0));
  vector<pair<int, int> > e;
  for (int i = 0; i < 8; i++) {
    string st;
    cin >> st;
    for (int j = 0; j < 8; j++) {
      if (st[j] == 'S') {
        e.push_back(make_pair(j, 7 - i));
      }
    }
  }
  pair<int, int> a = make_pair(7, 7);
  bool ng = 1;
  while (m.size() > 0 && ng) {
    if (!e.size()) {
      ng = 0;
      break;
    }
    vector<pair<int, int> > aux;
    for (auto it = m.begin(); it != m.end(); it++) {
      aux.push_back(*it);
    }
    for (auto it = aux.begin(); it != aux.end(); it++) {
      int x = it->first, y = it->second;
      for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
          if (x + mov[i] > -1 && x + mov[i] < 8 && y + mov[j] > -1 &&
              y + mov[j] < 8)
            m.insert(make_pair(x + mov[i], y + mov[j]));
        }
      }
    }
    for (int it = 0; it < e.size(); it++) {
      pair<int, int> pe = e[it];
      if (m.count(pe)) {
        m.erase(m.find(pe));
      }
      e[it].second--;
      pe = e[it];
      if (pe.second == -1) {
        e.erase(e.begin() + it);
        it--;
      } else {
        if (m.count(pe)) {
          m.erase(m.find(pe));
        }
      }
    }
    if (m.count(a)) ng = 0;
  }
  if (ng) {
    cout << "LOSE" << endl;
  } else {
    cout << "WIN" << endl;
  }
  return 0;
}
