#include <bits/stdc++.h>
using namespace std;
long long toint(string s) {
  istringstream in(s);
  long long x;
  in >> x;
  return x;
}
template <class T>
string tostring(T x) {
  ostringstream out;
  out << x;
  return out.str();
}
vector<string> v;
bool used[8][8];
int main(int argc, char *argv[]) {
  for (int i = 0; i < 8; i++) {
    string t;
    cin >> t;
    v.push_back(t);
  }
  v[7][0] = v[0][7] = '.';
  used[7][0] = 1;
  bool done = 1;
  for (int k = 0; k < 8; k++) {
    bool ok = 0;
    vector<pair<int, int> > steps;
    for (int i = 0; i < 8; i++) {
      for (int j = 0; j < 8; j++) {
        if (used[i][j]) {
          if (i - 1 >= 0 && v[i - 1][j] == '.')
            steps.push_back(make_pair(i - 1, j));
          if (i + 1 <= 7 && v[i + 1][j] == '.')
            steps.push_back(make_pair(i + 1, j));
          if (j - 1 >= 0 && v[i][j - 1] == '.')
            steps.push_back(make_pair(i, j - 1));
          if (j + 1 <= 7 && v[i][j + 1] == '.')
            steps.push_back(make_pair(i, j + 1));
          if (i - 1 >= 0 && j - 1 >= 0 && v[i - 1][j - 1] == '.')
            steps.push_back(make_pair(i - 1, j - 1));
          if (i - 1 >= 0 && j + 1 <= 7 && v[i - 1][j + 1] == '.')
            steps.push_back(make_pair(i - 1, j + 1));
          if (i + 1 <= 7 && j - 1 >= 0 && v[i + 1][j - 1] == '.')
            steps.push_back(make_pair(i + 1, j - 1));
          if (i + 1 <= 7 && j + 1 <= 7 && v[i + 1][j + 1] == '.')
            steps.push_back(make_pair(i + 1, j + 1));
          ok = 1;
        }
      }
    }
    if (ok) {
      for (int i = 0; i < steps.size(); i++) {
        int x = steps[i].first;
        int y = steps[i].second;
        used[x][y] = 1;
      }
      for (int i = 6; i >= 0; i--) {
        v[i + 1] = v[i];
        for (int j = 0; j < 8; j++) v[i][j] = '.';
      }
      for (int i = 0; i < 8; i++)
        for (int j = 0; j < 8; j++)
          if (v[i][j] == 'S') used[i][j] = 0;
    } else {
      done = 0;
      break;
    }
  }
  if (done)
    printf("WIN\n");
  else
    printf("LOSE\n");
  return 0;
}
