#include <bits/stdc++.h>
using namespace std;
int m = 8, n = 8;
const int maxn = 110;
string s[maxn];
bool mark[maxn][maxn][maxn];
bool can[maxn][maxn][maxn];
bool ch(int t, int x, int y) {
  if (x < 0 || y < 0 || y == m || x == n || can[t][x][y]) return 0;
  return 1;
}
bool dfs(int t, int x, int y) {
  if (t == n) return 1;
  mark[t][x][y] = 1;
  for (int i = -1; i <= 1; i++)
    for (int j = -1; j <= 1; j++)
      if (ch(t + 1, x + i, y + j) && ch(t, x + i, y + j))
        if (dfs(t + 1, x + i, y + j)) return 1;
  return 0;
}
int main() {
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (s[i][j] == 'S')
        for (int k = i; k < n; k++) can[k - i][k][j] = 1;
  if (dfs(0, n - 1, 0))
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return 0;
}
