#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5;
const long long int mod = 1e9 + 7;
map<long long int, map<long long int, bool> > mapi, mapj;
long long int pos[9][2] = {{0, 0},   {-1, 0}, {1, 0}, {0, 1}, {0, -1},
                           {-1, -1}, {-1, 1}, {1, 1}, {1, -1}};
int main() {
  ios::sync_with_stdio(false);
  queue<pair<long long int, long long int> > s;
  char arr[8][8];
  long long int cnt = 0;
  for (long long int i = 0; i < 8; i++) {
    for (long long int j = 0; j < 8; j++) {
      cin >> arr[i][j];
      if (arr[i][j] == 'S') {
        s.push(make_pair(i, j));
        cnt++;
      }
    }
  }
  queue<pair<long long int, long long int> > q;
  q.push(make_pair(7, 0));
  vector<pair<long long int, long long int> > sa, qa;
  while (!q.empty()) {
    sa.clear();
    qa.clear();
    mapi.clear();
    mapj.clear();
    while (!q.empty()) {
      pair<long long int, long long int> temp = q.front();
      qa.push_back(temp);
      if (temp.first == 0 && temp.second == 7) {
        cout << "WIN\n";
        return 0;
      }
      q.pop();
    }
    while (!s.empty()) {
      pair<long long int, long long int> temp = s.front();
      sa.push_back(temp);
      mapi[temp.first][temp.second] = 1;
      s.pop();
    }
    for (long long int i = 0; i < qa.size(); i++) {
      pair<long long int, long long int> temp = qa[i];
      for (long long int j = 0; j < 9; j++) {
        long long int inc_x = temp.first + pos[j][0];
        long long int inc_y = temp.second + pos[j][1];
        if (inc_x < 0 || inc_y < 0 || inc_x > 7 || inc_y > 7) {
          continue;
        }
        if (mapi[inc_x][inc_y]) {
          continue;
        }
        if (inc_x < 3) {
          if (!mapj[inc_x][inc_y]) {
            q.push(make_pair(inc_x, inc_y));
            mapj[inc_x][inc_y] = 1;
          }
        } else {
          if (!mapi[inc_x - 1][inc_y] && !mapj[inc_x][inc_y]) {
            q.push(make_pair(inc_x, inc_y));
            mapj[inc_x][inc_y] = 1;
          }
        }
      }
    }
    for (long long int i = 0; i < sa.size(); i++) {
      pair<long long int, long long int> temp = sa[i];
      if ((temp.first + 1) > 7) {
        continue;
      }
      s.push(make_pair(temp.first + 1, temp.second));
    }
  }
  cout << "LOSE\n";
  return 0;
}
