#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
int movex[] = {-1, 1, 0, 0, -1, 1, 1, -1, 0};
int movey[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
char a[10][10];
bool ok;
bool valid(int i, int j) { return i >= 0 and i < 8 and j >= 0 and j < 8; }
void dfs(int i, int j, int st) {
  if (a[i][j] == 'A' or st > 8) {
    ok = 1;
    return;
  }
  for (int k = 0; k < 9; k++) {
    int xx = movex[k] + i;
    int yy = movey[k] + j;
    if (!valid(xx, yy)) continue;
    if (xx >= st and a[xx - st][yy] == 'S') continue;
    if (xx > st and a[xx - st - 1][yy] == 'S') continue;
    dfs(xx, yy, st + 1);
  }
  return;
}
int solve() {
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 8; j++) cin >> a[i][j];
  dfs(7, 0, 0);
  cout << (ok ? "WIN" : "LOSE");
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  {
    solve();
    cout << '\n';
  }
}
