#define _CRT_SECURE_NO_WARNINGS #define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING #include using namespace std; #define CRP(t, x) const t &x #define OPX(op, t, x) operator op(CRP(t, x)) #define OPL(t, x) bool OPX(<, t, x) const #define FIL(x, v) memset(x, v, sizeof(x)) #define CLR(x) FIL(x, 0) #define NE1(x) FIL(x, -1) #define INF(x) FIL(x, 0x3f) #ifndef _DEBUG #define _DEBUG 0 #endif // !_DEBUG #define IFD if (_DEBUG) typedef int64_t ll, i64; typedef uint64_t ull, u64; template using comtype = typename common_type::type; template using enable_if_arithmetic = typename enable_if::value>::type; template using enable_if_integral = typename enable_if::value>::type; inline char getchar(int) { static char buf[64 << 20], *S = buf, *T = buf; if (S == T) T = fread(S = buf, 1, 64 << 20, stdin) + buf; return S == T ? EOF : *S++; } template > inline bool read(T &x) { int ch = x = 0, f = 1; while (!isdigit(ch = getchar())) if (ch == EOF) return false; else if (ch == '-') f = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0'; return x = f ? x : -x, true; } template > inline bool read(T &x, Args &... args) { return read(x) && read(args...); } template > inline TResult mmin(CRP(T1, v1), CRP(T2, v2)) { return min(v1, v2); } template > inline TResult mmin(CRP(T, v), const Args &... args) { return min(v, mmin(args...)); } template > inline TResult mmax(CRP(T1, v1), CRP(T2, v2)) { return max(v1, v2); } template > inline TResult mmax(CRP(T, v), const Args &... args) { return max(v, mmax(args...)); } inline ll gcd(ll a, ll b) { for (; b; swap(a, b)) a %= b; return a; } inline ll fpow(ll a, ll b, ll m) { ll r = 1; for (; b; b >>= 1, a = a * a % m) if (b & 1) r = r * a % m; return r; } constexpr double eps = 1e-8; inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; } constexpr int N = 105, M = 1e6 + 60; int dis[N][N], p[M]; char buf[N]; int main() { int n, m; read(n); for (int i = 1; i <= n; i++) { scanf("%s", buf + 1); for (int j = 1; j <= n; j++) dis[i][j] = buf[j] == '1' ? 1 : INT_MAX >> 1; dis[i][i] = 0; } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); vector ans; read(m); for (int i = 1; i <= m; i++) read(p[i]); ans.push_back(p[1]); for (int i = 2; i < m; i++) if (dis[ans.back()][p[i + 1]] != dis[ans.back()][p[i]] + dis[p[i]][p[i + 1]]) ans.push_back(p[i]); ans.push_back(p[m]); printf("%d\n", (int)ans.size()); for (int x : ans) printf("%d ", x); return 0; }