#include <iostream>
#include<algorithm>
#include <vector>

using namespace std;

struct edge {
	int a, b, cost;
};
vector<vector<int>> matrix;
int n, m=0;
vector<edge> e;
const int INF = 100000;
void solve() {
	vector<int> d(n);
	vector<int> p(n, -1);
	int x;
	for (int i = 0; i < n; ++i) {
		x = -1;
		for (int j = 0; j < m; ++j)
			if (d[e[j].b] > d[e[j].a] + e[j].cost)
			{
				d[e[j].b] = max(-INF, d[e[j].a] + e[j].cost);
				p[e[j].b] = e[j].a;
				x = e[j].b;
			}
	}

	if (x == -1)
		cout << "NO";
	else {
		int y = x;
		for (int i = 0; i < n; ++i)
			y = p[y];

		vector<int> path;
		for (int cur = y; ; cur = p[cur]) {
			path.push_back(cur);
			if (cur == y && path.size() > 1)  break;
		}
		reverse(path.begin(), path.end());

		cout << "YES "<<endl<<path.size()<<endl;
		for (size_t i = 0; i < path.size(); ++i)
			cout << path[i] +1<< ' ';
	}
}

int main() {
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);


	cin >> n;
	matrix.resize(n);
	for (int i = 0; i < n; i++)
		matrix[i].resize(n);


	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
		{
			cin >> matrix[i][j];
			if (INF != matrix[i][j])
			{
				m++;
				edge p = { i,j,matrix[i][j] };
				e.push_back(p);
			}
		}
	solve();

}