#include <bits/stdc++.h>
using namespace std;
int ans, n, n1, k;
char a[9][9];
string s, s1;
int dfs(int i, int j, int k) {
  if (k >= 7) {
    cout << "WIN";
    exit(0);
  }
  for (int i1 = -1; i1 <= 1; i1++)
    for (int j1 = -1; j1 <= 1; j1++) {
      int x = i + i1;
      int y = j + j1;
      if ((x > 7) || (x < 0) || (y > 7) || (y < 0)) continue;
      if (a[x - k - 1][y] == 'S' && x - k >= 1) continue;
      if (a[x - k][y] == 'S' && x - k >= 0) continue;
      dfs(x, y, k + 1);
    }
}
int main() {
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 8; j++) cin >> a[i][j];
  k = 0;
  dfs(7, 0, 0);
  cout << "LOSE";
  return 0;
}
