#include <bits/stdc++.h>
using namespace std;
int const N = 2000009;
char g[10][10];
bool vis[10][10][10];
int dx[] = {0, 0, 0, 1, 1, 1, -1, -1, -1},
    dy[] = {0, 1, -1, 0, 1, -1, 0, 1, -1};
bool bfs() {
  queue<pair<int, pair<int, int> > > q;
  q.push(make_pair(7, make_pair(0, 0)));
  vis[7][0][0] = 1;
  while (!q.empty()) {
    int x = q.front().first, y = q.front().second.first,
        d = q.front().second.second;
    if (g[x][y] == 'A') return 1;
    q.pop();
    for (int i = 0; i < 9; ++i) {
      int tx = x + dx[i], ty = y + dy[i], dd = d + 1;
      int td = tx - dd, tdd = tx - d;
      if (tx < 0 || tx >= 8 || ty < 0 || ty >= 8) continue;
      if (!vis[tx][ty][dd] && (g[td][ty] != 'S' || tdd < 0) &&
          (g[tdd][ty] != 'S' || tdd < 0)) {
        q.push(make_pair(tx, make_pair(ty, dd)));
        vis[tx][ty][dd] = 1;
      }
    }
  }
  return 0;
}
int main() {
  for (int i = 0; i < 8; ++i) scanf("%s", g[i]);
  bool an = bfs();
  cout << (an ? "WIN" : "LOSE") << "\n";
}
