#include <bits/stdc++.h>
using namespace std;
const int N = 9;
int dx[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int dy[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
char mp[N][N];
int dfs(int x, int y, int dep) {
  int i;
  if (dep == 9) return 1;
  for (i = 0; i < 9; i++) {
    int xx = x + dx[i];
    int yy = y + dy[i];
    if (xx < 1 || xx > 8 || yy < 1 || yy > 8 ||
        xx >= dep && mp[xx - dep + 1][yy] == 'S' ||
        xx >= dep - 1 && mp[xx - dep][yy] == 'S')
      continue;
    if (dfs(xx, yy, dep + 1)) return 1;
  }
  return 0;
}
int main() {
  int i, j;
  for (i = 1; i <= 8; i++)
    for (j = 1; j <= 8; j++) cin >> mp[i][j];
  if (dfs(8, 1, 1))
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
}
