#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const long long mod = 1e9 + 7;
const int oo = 1e9;
int n, k;
set<pair<int, int> > s;
int dx[9] = {-1, -1, -1, 0, 1, 1, 1, 0, 0};
int dy[9] = {-1, 0, 1, 1, 1, 0, -1, -1, 0};
bool win = 0;
bool vis[9][9];
void dfs(int x, int y, int move) {
  if (win) return;
  if ((x == 1 && y == 8) || move > 8) {
    win = 1;
    return;
  }
  if (s.find({x - move, y}) != s.end()) return;
  if (x < 1 || x > 8 || y < 1 || y > 8) return;
  for (int i = 0; i <= 8; i++) {
    int nx = x + dx[i];
    int ny = y + dy[i];
    if (s.find({nx - move, ny}) == s.end()) dfs(nx, ny, move + 1);
  }
}
int main() {
  for (int i = 1; i <= 8; i++)
    for (int j = 1; j <= 8; j++) {
      char c;
      cin >> c;
      if (c == 'S') s.insert({i, j});
    }
  dfs(8, 1, 0);
  if (win)
    printf("WIN");
  else
    printf("LOSE");
}
