#include <bits/stdc++.h>
using namespace std;
int moves[9][2] = {{0, 1},   {1, 1},  {1, 0},  {1, -1}, {0, -1},
                   {-1, -1}, {-1, 0}, {-1, 1}, {0, 0}};
vector<string> v;
bool dfs(int x, int y, int steps) {
  if (steps > 7) return 1;
  int i, xx, yy;
  for (i = 0; i < 9; ++i) {
    xx = x + moves[i][0];
    yy = y + moves[i][1];
    if (xx < 0 || xx > 7 || yy < 0 || yy > 7 ||
        ((yy >= steps) && v[yy - steps][xx] == 'S') ||
        ((yy >= steps + 1) && v[yy - steps - 1][xx] == 'S')) {
      continue;
    } else if (dfs(xx, yy, steps + 1))
      return 1;
  }
  return 0;
}
int main() {
  int i;
  string s;
  for (i = 0; i < 8; ++i) {
    cin >> s;
    v.push_back(s);
  }
  if (dfs(0, 7, 0))
    cout << "WIN";
  else
    cout << "LOSE";
  return 0;
}
