#include <bits/stdc++.h>
using namespace std;
vector<string> s;
vector<pair<int, int> > v;
int gf = 0;
int x[9] = {-1, -1, -1, 0, 1, 1, 1, 0, 0};
int y[9] = {-1, 0, 1, 1, 1, 0, -1, -1, 0};
void dfs(int a, int b, int le) {
  if (gf) return;
  if (le == 8 || (a == 0 && b == 7)) {
    gf = 1;
    return;
  }
  int a1, b1, i, j, k, x1, y1, flag, x2, y2;
  for (i = 0; i < 9; i++) {
    flag = 0;
    a1 = a + x[i], b1 = b + y[i];
    if (a1 >= 0 && a1 < 8 && b1 >= 0 && b1 < 8) {
      for (k = 0; k < v.size(); k++) {
        x1 = v[k].first + (le + 1);
        y1 = v[k].second;
        x2 = v[k].first + (le);
        y2 = v[k].second;
        if ((a1 == x1 && b1 == y1) || (a1 == x2 && b1 == y2)) flag = 1;
      }
      if (flag == 0) dfs(a1, b1, le + 1);
    }
  }
}
int main() {
  string st;
  int i;
  for (i = 0; i < 8; i++) {
    cin >> st;
    s.push_back(st);
  }
  int j;
  for (i = 0; i < 8; i++) {
    for (j = 0; j < 8; j++) {
      if (s[i][j] == 'S') v.push_back(make_pair(i, j));
    }
  }
  dfs(7, 0, 0);
  if (gf)
    cout << "WIN"
         << "\n";
  else
    cout << "LOSE"
         << "\n";
  return 0;
}
