#include <bits/stdc++.h>
using namespace std;
int a[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1},
    b[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
char mp[8][8];
bool dfs(int x, int y, int step) {
  int xx, yy, i;
  if (step > 8) {
    return 1;
  }
  for (int i = 0; i < 9; i++) {
    xx = x + a[i];
    yy = y + b[i];
    if (xx < 0 || xx > 7 || yy < 0 || yy > 7) {
      continue;
    }
    if (xx - step >= 0 && mp[xx - step][yy] == 'S') {
      continue;
    }
    if (xx - step - 1 >= 0 && mp[xx - step - 1][yy] == 'S') {
      continue;
    }
    if (dfs(xx, yy, step + 1)) {
      return 1;
    }
  }
  return 0;
}
void solve() {
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      cin >> mp[i][j];
    }
  }
  if (dfs(7, 0, 0)) {
    cout << "WIN";
  } else {
    cout << "LOSE";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (--t >= 0) {
    solve();
  }
  return 0;
}
