out.txt

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST s = "459845908405984";
	int sum = 0;

	forn(i, s.size())
		sum += s[i] - '0';
	cout << sum << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST s;
	cin >> s;

	int ret = -1;

	forn(i, s.size()) {
		forab(j, i+1, s.size() -2) {

			ST as =  s.substr(0, i+1) ;
			ST bs = s.substr(i+1, j-i);
			ST cs = s.substr(j+1) ;

//			if(as.length() > 7 || bs.length() > 7 || cs.length() > 7)
//				continue;

			if(as.size() > 1 && as[0] == '0')
				continue;
			if(bs.size() > 1 && bs[0] == '0')
				continue;
			if(cs.size() > 1 && cs[0] == '0')
				continue;

			int a =  0;//atoi(as.c_str());
			int b = 0; //atoi(bs.c_str());
			int c = 0; //atoi(cs.c_str());

			forn(k, as.size())
				a += as[k] - '0';
			forn(k, bs.size())
				b += bs[k] - '0';
			forn(k, cs.size())
				c += cs[k] - '0';
//			cout << a << " " << b << " " << c << endl;

			if(a > (int)1e6 || b >  (int)1e6 || c > (int)1e6)
				continue;
			ret = max(ret, a+b+c);
		}
	}

	cout << ret << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

struct Node {
	int64 cnt, cost;
	Node(int64 _cnt, int64 _cost) {
		cnt = _cnt;
		cost = _cost;
	}
};

bool operator < (const Node &a, const Node &b) {
	return a.cost < b.cost;
}

int main()
{
	vector <Node> obj;

	int64 n;
	cin >> n;
	forn(_n, n) {
		int64 a, b;
		cin >> a >> b;
		obj.pb(Node(a, b));
	}
	sort(all(obj));

	int64 t;
	cin >> t;
	vector <int64> p;
	forn(_t, t) {
		int64 tmp;
		cin >> tmp;
		p.pb(tmp);
	}
	sort(all(p));
/*
	for(auto &x: obj)
		cout << x.cnt << " " << x.cost << endl;
	cout <<  endl;
	for(auto &x: p)
		cout << x << " ";
	cout << endl << endl;
*/
	int64 ret = 0, f = 1ll;

	int j = 0, i = 0;

	while(i < obj.size()) {
/*		Pf("p[%d] = %lld, x%lld\n", j, p[j], f);
		forab(k, i, obj.size() - 1)
			Pf("(%lld, %lld) ", obj[k].cnt, obj[k].cost);
		cout << endl;
*/
		if(obj[i].cnt == 0) {
//			Pf("#0\n");
			i++;
		}
		else if(j == p.size()) {
//			Pf("#1\n");
			ret += obj[i].cnt * obj[i].cost * f;
			obj[i].cnt = 0;
			i++;
		}
		else if(obj[i].cnt >= p[j]) {
//			Pf("#2\n");
			ret += obj[i].cost * p[j] * f;
			obj[i].cnt -= p[j];
			p[j] = 0;
			j++;
			f++;
		}
		else {		// obj[i].cnt < p[j]
//			Pf("#3\n");
			ret += obj[i].cnt * obj[i].cost * f;
			p[j] -= obj[i].cnt;
			obj[i].cnt = 0;
			i++;
		}
//		cout << ret << endl << endl;
	}
//	cout << endl;
	
	cout << ret << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n;
	read(n);
	map <ST, int> m;

	while(n--) {
		ST s;
		int a;
		cin >> s >> a;
		m[s] = max(m[s], a);
	}

	int total = m.size();

	cout << total << endl;

	for(auto &x: m) {
		int worse = 0, better = 0;

		for(auto &y: m) {
			if(y.second > x.second)
				better++;
			if(x.second >= y.second)
				worse++;
		}
		Pf("%s ", x.first.c_str());

		if(100*worse >= 99*total)
			Pf("pro");
		else if(10*worse >= 9*total && 100*better > total)
			Pf("hardcore");
		else if(5*worse >= 4*total && 10*better > total)
			Pf("average");
		else if(2*worse >= total && 5*better > total)
			Pf("random");
		else if(2*better > total)
			Pf("noob");
		else
			assert(0);

/*
		if(100*better < 99*total)
			Pf("pro");
		else if(10*better < 9*total)
			Pf("hardcore");
		else if(10*better < 8*total)
			Pf("average");
		else if(10*better < 5*total)
			Pf("random");
		else
			Pf("noob");
*/
			Pf("\n");
	}
	
	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

void process(int n , vi & v) {
	v.clear();
	forab(i, 1, n)
		if(! (n % i))
			v.pb(i);
}

int main()
{
	int n;
	cin >> n;

	forn(i, n) {
		int x, y;
		cin >> x >> y;
		
		vi v;
		process(x, v);

		Pf("%d (%d) -> ", x, v.size());
		tr(it, v)
			cout << *it << " ";
		cout << endl;

	}

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int64 x, y, n;
	cin >> n >> x >> y;

	int64 s = y - (n-1);
	int64 sumsq = s*s + (n-1);

	if(sumsq >= x && s > 0)
	{
		Pf("%lld\n", s);
		forn(i, n-1)
			Pf("1\n");
	}
	else
		cout << -1 << endl;


	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define lim 100001

int idx[lim];

void getDivisor(int n, vi& v) {
	int i;
	for( i = 1; i*i <= n; i++)
		if(! (n % i))
			if(i != n/i)
				v.pb(i), 	v.pb(n/i);
			else
				v.pb(i);
	sort(all(v));
}
int main()
{
	int X[lim], n, y;
	CL(idx, -1);

	cin >> n ;
	vvi factor(n);

	int x;
	forn(i, n) {
		Sf("%d %d", &X[i], &y);
		x = X[i];

		vi &f = factor[i];
		if(idx[x] > -1)
			f = factor[idx[x]];
		else
			getDivisor(x, f),	idx[x] = i;

//		Pf("%d : (%d - %d)\n", x, i - y, i - 1);
/*		Pf("%d (%d) -> ", x, f.size());
		tr(it, f)
			cout << *it << " ";
		cout << endl;
*/
		bool flag;
		int cnt = 0;
		forn(j, f.size()) {
			flag = true;
			forab(k, i - y, i-1)
				if(binary_search(all(factor[k]), f[j])) {
					flag = false; 	break;
				}
			if(flag)
				cnt++;
		}
		Pf("%d\n", cnt);
	}

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	string a, b;
	cin >> a >> b;
	
	forn(i, a.length())
		a[i] = tolower(a[i]);

	forn(i, b.length())
		b[i] = tolower(b[i]);

//	cout << a << endl << b << endl;

	if(a == b)
		cout << 0 << endl;
	else if(a < b)
		cout << -1 << endl;
	else
		cout << 1 << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define lim 100010

bool p[lim];
vector < set<int> > s(lim);

void preprocess() {
	CL(p, -1);

	p[0] = p[1] = false;
	s[1].insert(1);

	for(int i = 2; i*i < lim; i++)
		if(p[i]) {
			s[i].insert(i);
			for(int j = i+i; j<lim; j+= i)
				s[j].insert(i), p[j] = false;
		}
/*
	forn(i, 25)
	{
		cout << i << " : ";
		tr(it, s[i])
			cout << *it << ", ";
		cout << endl;
	}
*/

}

int main()
{
	preprocess();
	int x[lim], y[lim], n;

	cin >> n;

	forab(i, 1, n) {
		Sf("%d %d", &x[i], &y[i]);
		map <int, int> m;

		tr(it, s[x[i]])
			m[*it] = true;

/*		cout << x[i] << ": ";
		tr(it, m)
			cout << it->first << " ";
		cout << endl;
*/
		forab(j, i - y[i], i-1) {
//			cout << x[j] << " ";
			tr(it, m)	if(it->second == true) {
				if(x[j] % it->first == 0)
					it->second = false;
			}
		}
//		cout << endl;

		cout << x[i] << " : ";
		tr(it, m)	if(it->second)
			cout << it->first << " ";
		cout << endl;
		cout << endl;
	}
	

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int sz, x, y;
	cin >> sz >> x >> y;
	x--, 	y--;

	if( (x == sz/2 || x == (sz-1)/2) && (y == sz / 2 || y == (sz-1)/2))
		cout << "NO\n";
	else
		cout << "YES\n";

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int R, C;
enum {black, grey, white};
const int sz = 1600;
bool vis[sz][sz];
char G[sz][sz];

int X[] = {1, -1, 0,  0};
int Y[] = {0,  0, 1, -1};
bool isValid(int y, int x) {
	return y >= 0 && y < R && x >= 0 && x < C;
}

#define YY first
#define XX second

int main()
{
	cin >> R >> C;
	forn(i, R)
		cin >> G[i];
	int xs, ys;

	forn(i, R) {
		forn(j, C) {
//			cout << G[i][j];
			if(G[i][j] == 'S')
				ys = i, xs = j;
		}
//		cout << endl;
	}

//	DEBUG(ys);
//	DEBUG(xs);
	queue <ii> q;

	q.push(mp(ys, xs));
	vis[ys][xs] = true;

	while(!q.empty()) {
		ii nd = q.front();
		q.pop();
//		Pf("(%d, %d) -> ", nd.YY, nd.XX);

		forn(i, 4) {
			int x = (nd.XX + X[i] + C) % C;
			int y = (nd.YY + Y[i] + R) % R;
			if(isValid(y, x) && G[y][x] != '#' && !vis[y][x]) {
				vis[y][x] = true;
				q.push(mp(y, x));
			}
		}
	}
//	cout << endl;
/*
	forn(r, R) {
		forn(c, C)
			cout << vis[r][c];
		cout << endl;
	}
*/
	forn(c, C)
		if(vis[0][c] && vis[R-1][c]) {
			cout << "Yes" << endl;
			return 0;
		}

	forn(r, R)
		if(vis[r][0] && vis[r][C-1]) {
			cout << "Yes" << endl;
			return 0;
		}

	cout << "No" << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	map <int, vi> idx;
	ST st;
	cin >> st;
	reverse(all(st));
/*
	forn(i, st.size())
		Pf("%-3c ", st[i]);
	cout << endl;
	forn(i, st.size())
		Pf("%-3d ", i);
	cout << endl;
*/
	forn(i, st.size())
		idx[st[i] - 'a'].pb(i );

	int lst = 1e6;

	rep(i, 25, 0) {
		vi &v = idx[i];
		if(v.empty())
			continue;
/*
		Pf("%c: ", i+ 'a');
		for(auto &x: v)
			cout << x << " ";
		cout << endl;
*/
		int id = lower_bound(all(v), lst) - v.begin();;
		id--;
		while(id > -1) {
			Pf("%c", i+'a');

			lst = v[id];
			id--;
		}
	}

	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e5 + 111;
int par[sz], idx[30], dist[sz];

int main()
{
	ST st;
	cin >> st;
	reverse(all(st));
	DEBUG(st);

	CL(par, -1);
	CL(dist, 0);
	CL(idx, -1);

	forn(i, st.size()) {
		int cur = st[i] - 'a';
		int p = dist[cur];

		dist[cur] = 1;
		par[i] = -1;

		forab(j, 0, cur-1) {
			if(dist[j] + 1 >= dist[cur]) {
				dist[cur] = dist[j] + 1;
				par[i] = idx[j];
			}
		}

		if(p + 1 >= dist[cur]) {
			dist[cur] = p+1;
			par[i] = idx[cur];
		}

		idx[cur] = i;

		Pf("st[%d] = %c, dist = %d, par[%d] = %d, idx[%c] = %d\n", i, cur + 'a', dist[cur],i, par[i], st[i], idx[cur]);
	}
	cout << endl << endl;
/*
	forn(i, st.size())
		Pf("st[%d] = %c, par[%d] = %d\n", i, st[i], i, par[i]);
	cout << endl;
*/
	int id = 'z' - 'a';

	rep(i, 'z' - 'a', 0) {
		if(dist[i] > dist[id])
			id = i;
	}
//	DEBUG(id);

	id = idx[id];
//	DEBUG(id);

	while(id > -1) {
		Pf("%c", st[id]);
//		Pf("st[%d] = %c, par = %d\n", id,  st[id], par[id]);
//		cout << endl;
		id = par[id];
//		DEBUG(id);
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int a[111] = {}, b[111] = {};
	int n, m;
	cin >> n >> m;

	forn(i, n+1)
		cin >> a[i];
	forn(i, m+1)
		cin >> b[i];

	if(n == 0 && m == 0) {
		int sign = a[0]*b[0] < 0 ? -1 : 1;
		a[0] = abs(a[0]);
		b[0] = abs(b[0]);
		int d = __gcd(a[0], b[0]);
		cout << sign*a[0]/d << "/" << b[0]/d << endl;
	}
	else if(n == 0 && m != 0) {
//		cout << (b[0] < 0 ? "-1" : "") << "Infinity" << endl;
		cout << "0/1" << endl;
	}
	else if(n != 0 && m == 0) {
		int sign = a[0] < 0 ? -1 : 1;
		cout << (sign == -1 ? "-" : "") << "Infinity" << endl;
	}
	else if(n > m) {
//		cout << a[0] << "/" << 1 << endl;
		int sign = a[0] < 0 ? -1 : 1;
		cout << (sign == -1 ? "-" : "") << "Infinity" << endl;
	}
	else if(n < m) {
		cout << "0/1" << endl;
		//int sign = b[0] < 0 ? -1 : 1;
	//	cout << (sign == -1 ? "-" : "") << "Infinity" << endl;
	}
	else {		// n == m
		int sign = a[0] * b[0] < 0 ? -1 : 1;
		a[0] = abs(a[0]);
		b[0] = abs(b[0]);
		int d= __gcd(a[0], b[0]);
		cout << sign*a[0]/d << "/" << b[0]/d << endl;
	}

	return 0;
}

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;
ST a, b;
int ans = 0;

void process(char cl, char cr) {
	int l = 0, r = a.size() - 1;
	int len = a.size();

	while(l < len && r >= 0) {
		if(a[l] == b[l])
			l++;
		else if(a[r] == b[r])
			r--;
		else if(a[l] != cl)
			l++;
		else if(a[r] != cr)
			r--;
		else {
			swap(a[l], a[r]);
			l++;
			r--;
			ans++;
		}
	}
}

int main()
{
	cin >> a >> b;
	process('4', '7');
	process('7', '4');

	for(int i = 0, lets_stop_here = (int)a.size(); i < lets_stop_here; i++)
		if(a[i] != b[i])
			ans++;
	printf("%d\n", ans);

	return 0;
}
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

ST a, b;
int ans = 0;

void process(char cl, char cr) {
	int l = 0, r = a.size() - 1;
	int len = a.size();

	while(l < len && r >= 0) {
		if(a[l] == b[l])
			l++;
		else if(a[r] == b[r])
			r--;
		else if(a[l] != cl)
			l++;
		else if(a[r] != cr)
			r--;
		else {
			swap(a[l], a[r]);
			l++;
			r--;
			ans++;
		}
	}
}

int main()
{
	cin >> a >> b;
	process('4', '7');
	process('7', '4');

	forn(i, a.size())	
		if(a[i] != b[i])
			ans++;
	writeln(ans);

	return 0;
}

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

int main()
{
	int n;
	ST s;
	cin >> n >> s;
	int t = n;

	forn(i, n) {
		if(!(s[i] == '4' || s[i] == '7')) {
			cout << "NO" << endl;
			return 0;
		}
	}
	int l = 0, r = 0;
	forn(i, n/2) {
		l += s[i] - '0';
		r += s[n/2+i] - '0';
	}
	if(l != r) {
		cout << "NO" << endl;
		return 0;
	}
	cout << "YES" << endl;
	return 0;
}

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

ST ans;

bool process(int c4, int c7, int c47, int c74) {
	ans = "";

	if(c47 == c74) {
		int t = c4 - c47 - 1;
		if(t < 0 || c7 < c74)
			return false;
		while(t--) {
			ans += '4';
			c4--;
		}
		while(c47) {
			ans += "47";
			c47--;
			c74--;
			c4--;
			c7--;
		}
		while(c7) {
			ans += "7";
			c7--;
		}
		ans += "4";
		c4--;
		if(c4 < 0 || c7 < 0 || c47 < 0 || c74 < 0)
			return false;
		return true;
	}

	if(c47 == c74 + 1) {
		int t = c4 - c47 - 0;
		if(t < 0 || c7 < c47)
			return false;
		while(t--) {
			ans += '4';
			c4--;
		}
		while(c47) {
			ans += "47";
			c47--;
			c74--;
			c4--;
			c7--;
		}
		c74++;
		while(c7) {
			ans += "7";
			c7--;
		}
		if(c4 < 0 || c7 < 0 || c47 < 0 || c74 < 0)
			return false;
		return true;
	}

	if(c47 + 1 == c74 ) {
		ans += "74";
		c74--;	c4--;	c7--;
		int t = c4 - c47 - 1;
		if(t < 0 || c7 < c47)
			return false;
		while(t--) {
			ans += '4';
			c4--;
		}
		while(c47) {
			ans += "47";
			c47--;
			c74--;
			c4--;
			c7--;
		}
		c74++;
		while(c7) {
			ans += "7";
			c7--;
		}
		ans += "4";
		c4--;
		c74--;
		if(c4 < 0 || c7 < 0 || c47 < 0 || c74 < 0)
			return false;
		return true;
	}
	return false;
}
int main()
{
	int c4, c7, c47, c74;
	cin >> c4 >> c7 >> c47 >> c74;

	bool ret = process(c4, c7, c47, c74);
	if(c47 == c74)
		ret = process(c4, c7, c47, c74);
	else if(c47 == c74+1) {
		ret = process(c4, c7-1, c47-1, c74); 
		ans += "7";
	}
	else if(c47 == c74-1) {
		ret = process(c4, c7-1, c47, c74-1); 
		ans = "7" + ans;
	}
	else
		ret = false;

	if(ret)
		cout << ans << endl;
	else
		cout << -1 << endl;

	return 0;
}

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

int a, b;

int reverse(int a) {
	int ans = 0;
	while(a) {
		ans = ans*10 + a%10;
		a/=10;
	}
	return ans;
}

int mask(int m) {
	int ans = 0, t;
	while(m) {
		t = m%10;
		m /= 10;
		if(t == 4 || t == 7)
			ans = ans*10 + t;
	}
	return ans;
}

int main()
{
	int a, b;
	cin >> a >> b;
	int ac = max(a+1, b);
	b = reverse(b);

	forab(c, ac, 777777) {
		if(b == mask(c)) {
			cout << c << endl;
			return 0;
		}
	}

	cout << -1 << endl;
	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;

	cin >> n;

	for(int i = 2; i*i <= n; i++)
	{
		while(n%i == 0)
		{
			cout << i << " ";
			n /= i;
		}
	}

	if(n > 0)
		cout << n;
	cout << endl;



	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int gcd(int a, int b)
{
	return b==0? a: gcd(b, a%b);
}

int main()
{
	int a, b;
	cin >> a >> b;
	
	cout << gcd(a, b) << endl;
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int n, ht[2000], water[2000];

void Process(int idx)
{
	water[idx] = 1;

	rep(i, idx-1, 0)
	{
		if(ht[i] <= ht[i+1])
			water[idx]++;
		else
			break;
	}
	forab(i, idx+1, n-1)
	{
		if(ht[i] <= ht[i-1])
			water[idx]++;
		else
			break;
	}
}


int main()
{

	while(cin >> n)
	{
		CL(water, 0);
		forn(i, n)	cin >> ht[i];

		forn(i, n)
			Process(i);

		cout << *max_element(water, water+n) << endl;
	}
	

	return 0;
}
//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int64 mod = 1e9+7;

int main()
{
	int N, M;
	cin >> N >> M;
	vs name(N);

	forn(n, N)
		cin >> name[n];

	int64 ans = 1;
	forn(m, M) {
		set <char> s;
		s.clear();

		forn(n, N)
			s.insert(name[n][m]);

		ans = (ans * s.size()) % mod;
		ans = (ans + mod) % mod;

	}
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int N, M;
	cin >> N >> M;

	ST marks[N];

	forn(n, N)
		cin >> marks[n];

	bool succ[1000] = {false};

	forn(m, M) {
		char mx = '0';

		forn(n, N)
			mx = max(mx, marks[n][m]);

		forn(n, N)
			if(marks[n][m] == mx)
				succ[n] = true;
	}
	int ans = 0;
	forn(n, N)
		if(succ[n])
			ans++;
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

struct Node {
	int x, y, c;
	Node() { x = y = c = -1;}
	Node(int _x, int _y)  {	x = _x, y = _y, c = -1; }
	Node(int _x, int _y, int _c)	{ x = _x, y = _y, c = _c; }
};

bool operator < (const Node &a, const Node & b) { 	return a.c > b.c; }

int N, M, K;
int flower[111][111];
bool Flower[111][111];
int ans = 1e9;
vector <ii> idx;
int X[] = { 1, -1, 0,  0};
int Y[] = { 0,  0, 1, -1};
bool in[111][111], in2[111][111];
int par[111][111][2];
int cost[111][111];

void dijkstra(int sx, int sy) {
	priority_queue <Node> pq;
	forn(n, N)	forn(m, M) {
		in2[n][m] = in[n][m];
		if(in[n][m])
			cost[n][m] = 0;
		else
			cost[n][m] = 1e9;
	}

	pq.push(Node(sx, sy, flower[sx][sy]));
	int x,y, c;

	while(!pq.empty()) {
		x = pq.top().x, y = pq.top().y, c = pq.top().c;
		pq.pop();
		if(in2[x][y])
			break;
		in2[x][y] = true;

		forn(i, 4){
			int xx = x + X[i], yy = y + Y[i];
			if(xx >= 0 && xx < N && yy >= 0 && yy < M)
				if(cost[xx][yy] > cost[x][y] + flower[xx][yy]) {
					cost[xx][yy] = cost[x][y] + flower[xx][yy];
					pq.push(Node(xx, yy, cost[xx][yy]));
				}
		}
	}

	while(true) {
		in[x][y] = true;
		int tx = par[x][y][0], ty = par[x][y][1];
		x = tx, y = ty;
		if(x == sx && y == sy)
			break;
	}
}

int main()
{
	cin >> N >> M >> K;
	forn(n, N)	forn(m, M)	read(flower[n][m]);

	idx.resize(K);
	forn(k, K) {
		read(idx[k].first);
		read(idx[k].second);
	}
	sort(all(idx));

	do {
		in[idx[0].first][idx[0].second] = true;
		cost[idx[0].first][idx[0].second] = flower[idx[0].first][idx[0].second];

	} while(next_permutation(all(idx)));

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int64 N, M;
	cin >> N >> M;
	int64 x, y;

	cin >> x >> y;

	int K;
	cin >> K;
	int64 ans = 0;
//	cout << x <<  " " << y << endl;

	while(K--) {
		int64 dx, dy;
		cin >> dx >> dy;

		int64 step = 1e14;

		if(dx > 0)
			step = min(step, (N - x)/dx);
		else if(dx < 0)
			step = min(step, (int64)/*ceil*/((1.0-x)/ dx));

		if(dy > 0)
			step = min(step, (M - y)/dy);
		else if(dy < 0)
			step = min(step, (int64)/*ceil*/((1.0-y)/ dy));

		ans += step;
		x += step*dx;
		y += step*dy;
//		cout << x << " " << y << endl;
	}
	cout << ans << endl;
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST A, B;
	cin >> A >> B;
	ST a, b;
	if(A.length() < B.length())
		a = A, b = B;
	else
		a = B, b = A;


	bool flag = true;

	for(int i = 0; flag && i < a.size(); i++)
		flag &= (a[i] == b[i] ? true: false);

	if(!flag ) {
		cout << 0 << endl;
		return 0;
	}

	int ret = 0;
	for(int i = 1; i <= a.size(); i++)	if(a.size() % i == 0) {
		int blocks = a.size() / i;
		int len = i;

		flag = true;

		if(b.size() % len != 0)
			continue;

		for(int l = 0; flag && l < len; l++) {
			for(int b = 0; flag && b < blocks; b++)
				flag &= (a[l] == a[len*b + l] ? true : false);
		}

		blocks = b.size() / len;
		for(int l = 0; flag && l < len; l++) {
			for(int nb = 0; flag && nb < blocks; nb++)
				flag &= (a[l] == b[len*nb + l]);
		}

//		Pf("len = %d, blocks = %d, flag = %d\n", len, blocks, flag);

		if(flag && b.size() % i == 0)
			ret++;
	}
	
	cout << ret << endl;
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int mod = 1e9 + 7;

int board[111][2];
int n, l;

int Ans[110][3010][110];

int cal (int idx, int len, int lst = -1) {
//	Pf("idx = %d, len = %d, lst = %d\n", idx, len, lst);
	if(len == 0)
		return 1;
	if(len < 0)
		return 0;

	assert(idx >= -1 && idx <= 100);
	assert(lst >= -1 && lst <= 100);
	assert(len >= 0 && len <= 3000);

	int rret = 0;
	if(lst == -1) {
//		cout << "#a\n";
		forn(i, n) {
			if(len - board[i][0] >= 0)
				rret = (rret + cal(i, len-board[i][0], board[i][1])) % mod;
			if(len - board[i][1] >= 0 && board[i][0] != board[i][1])
				rret = (rret + cal(i, len-board[i][1], board[i][0])) % mod;
		}
		return rret;
	}

	int &ret = Ans[idx][len][lst];

	if(ret > -1)
		return ret;

	ret = 0;


	forn(i, n) 	if(i != idx) {
		if(board[i][0] == lst) {
			ret = (ret + cal(i, len - lst, board[i][1])) % mod;
		}
		else if(board[i][1] == lst)
			ret = (ret + cal(i, len-lst, board[i][0])) % mod;
	}
	return ret;
}

int main()
{
	CL(Ans, -1);
	Sf("%d %d", &n, &l);
//	Pf("n = %d, l = %d\n", n, l);
	forn(i, n)
		Sf("%d %d", &board[i][0], &board[i][1]);
	
//	cout << "#2" << endl;
	cout << cal(-1, l, -1) << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int n, len, k;
int64 arr[(int)1e5 + 11];
int64 tmp[(int)1e5 + 11];

int main()
{
	cin >> n >> len;

	forn(i, n) {
		Sf("%lld", &arr[i]);
		tmp[i] = arr[i];
	}

	sort(tmp, tmp+len);
	cin >> k;
	int K = k;

	int ret = 0;

	forn(i, len)
		if(tmp[i] < 0 && K > 0) {
			K--;
			ret += -tmp[i];
		}
		else
			ret += tmp[i];



	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n = 100, l = 3000;
	cout << n << " " << l << endl;

	forn(i, n)
		cout << 1 + rand()%100 << " " << 1 + rand()%100 << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		VS;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	VS vs;
	ST st, msg, msg2, tmp;
	char ch;
	vs.clear();
	int N;
	cin >> N;
	getline(cin, tmp);

	bool find = false;
	ST thro = "";

	char cmsg[111], cmsg2[111] = {}, cst[111];

	forn(i, N) {
		cout << endl;
		DEBUG(i);
		getline(cin, tmp);
		DEBUG(tmp);
		CL(cmsg, 0);
		CL(cmsg2, 0);
		CL(cst, 0);
		SS ss(tmp);

		ss >> st;

		if(st == "try") {
			vs.pb(st);
			continue;
		}
		sscanf(tmp.c_str(), "%*[ ]%[^ ^(]", cst);
		cout << cst << endl;
//		sscanf(tmp.c_str(), "%*[ ]%[^(^ ]%*[( ]%[a-zA-Z]%*[) ,\"]%[^\"]", cst, cmsg, cmsg2);
//		cout << cst << "|" << cmsg << "|" << cmsg2 << endl;
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int N, M;

struct Node {
	int idx, cnt, d;
	Node(int id, int c) {
		idx = id;
		cnt = c;
		if(M%2 == 1)
			d = abs((M+1)/2 - idx);
		else
			d = min( abs((M+1)/2 - idx), abs( (M+2)/2 - idx) );
	}
};

bool operator < (const Node &a, const Node &b) {
	if(a.cnt != b.cnt)
		return a.cnt > b.cnt;
	if(a.d != b.d)
		return a.d > b.d;
	return a.idx > b.idx;
}

int main()
{
	cin >> N >> M;
	priority_queue <Node> pq;

	forn(i, M)
		pq.push(Node(i+1, 0));

	forn(i, N) {
		Node nd = pq.top();
		pq.pop();
		writeln(nd.idx);
		nd.cnt++;
		pq.push(nd);
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e5;
vector <int64> num(sz) ;

int main()
{
	for(int64 i = 0; i < sz; i++)
		num[i] = (i+1)*(i+2)/2;

	int64 N;
	cin >> N;

	forn(i, num.size()) {
		if(binary_search(all(num), N - num[i]) == true) {
			cout << "YES\n";
			return 0;
		}
	}
	cout << "NO\n";
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int dp[30][30];
	CL(dp, -1);

	int N;
	cin>> N;

	forn(i, N) {
		ST st;
		cin >> st;
		int s = st[0] - 'a', e = st[st.size() - 1] - 'a', len = st.size();

		forn(i, 26){
			if(dp[i][s] > -1)
				dp[i][e] = max(dp[i][e], dp[i][s] + len);
		}
		dp[s][e] = max(dp[s][e], len);
	}

	int ans= 0;
	forn(i, 26)
		ans = max(ans, dp[i][i]);
	cout << ans << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e4;
int arr[sz], N;
bool vis[sz];

bool solve(int d) {
	CL(vis, 0);
	if(arr[0] == d || arr[N-1] == d)
		return false;

	vis[0] = true;
	if(arr[1] <= d)
		vis[1] = false;
	else
		vis[1] = true;

	forab(i, 2, N-1) {
		if(arr[i] > d && (vis[i-1] || vis[i-2]))
			vis[i] = true;
		else
			vis[i] = false;
	}
	return vis[N-1];
}

int main()
{
	cin >> N;

	forn(i, N)	cin >> arr[i];

	forab(d, 1, 1001) {
		if(!solve(d)) {
			cout << d << endl;
			break;
		}
	}
	
	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int n, g[110][110] = {}, ans = 0, vis[110] = {};

void dfs(int v) {
	forn(i, n)
	{
		if(g[v][i] == 1){
			if(vis[i] == 0)
				vis[i] = vis[v] + 1, dfs(i);
		
			else if(vis[v] - vis[i] > 1)
				ans++;
		}
	}
}

int main()
{
	int x, y, m;
	cin >> n >> m;
	forn(i, m) {
		cin >> x >> y;
		x--, y--;
		g[x][y] = g[y][x] = 1;
	}
	vis[0] = 1;
	dfs(0);
	cout << (ans == 1 ? "F" : "NO")  << endl;

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int circle, n, m ;
int vis[110] ={0};
bool g[110][110] = {false};

void dfs(int idx, int par)  {
	if(vis[idx] == 2)
		circle++;

	if(circle >2){
		cout << "NO\n";
		exit(0);
	}

	if(vis[idx])
		return;

	vis[idx] = 2;

	forab(i, 1, n)	if(i != par)
		if(g[idx][i])
			dfs(i, idx);
	vis[idx] = 1;
}

int main()
{
	int x, y;
	circle = 0;

	cin >> n >> m;

	forab(i, 1, m)
		Sf("%d %d", &x, &y),	g[x][y] = g[y][x] = true;

	dfs(1, -1);

	forab(i, 1, n)
		if(!vis[i])
			Pf("NO\n"),	exit(0);;

	if(circle == 1)
		cout << "FHTAGN!\n";
	else
		cout << "NO\n";

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	cin >> n;
	if(n-10 > 0 && n - 10 <= 11) {
		if(n-10 == 10)
			cout << 15 << endl;
		else
			cout << 4 << endl;
	}
	else
		cout << 0 << endl;

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int n, m, g[110][110], par[110];

int find(int x) {
	return x == par[x] ? x : ( par[x] = find(par[x]) );
}

void merge(int x, int y) {
	int px = find(x), py = find(y);
	par[px] = par[py] = min(px, py);
}

int main()
{
	int x, y, circle = 0;
	cin >> n >> m;

	forn(i, 110)	par[i] = i;

	forn(_x, m) {
		Sf("%d %d", &x, &y);
		if(find(x) == find (y))
			circle++;
		merge(x, y);
	}
/*
	Pf("circle = %d\nParents : \n",circle);
	forab(i, 1, n)
		Pf("%d: %d\n", i, find(i));
	cout << endl;
*/

	if(circle != 1) {
		cout << "NO\n";
		exit(0);
	}
	forab(i, 1, n)
		if(find(i) != 1)
			cout << "NO\n",		exit(0);
	cout << "FHTAGN!\n";

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	int64 b[500];
	cin >> n;
	int64 ans[500];
	forab(i, 1, n)
		cin >> b[i];

	ans[1] = b[1];

	forab(i, 2, n)
		ans[i] = ans[i-1] - (i-1) + i*b[i];

	cout << ans[n] << endl;


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

bool  cnt[1000000] = {};
int count[1000000] = {};

int main()
{
	cnt[4] = cnt[7]  = true;
	count[4] = 1,	count[7] = 2;

	forn(i, 100000)
		if(cnt[i])
			cnt[i+4] = cnt[i+7] = true/* , 	count[i+4] = max(count[i] + 1, count[i+4]),	count[i+7] = max(count[i+7], count[i] + 1)*/:

	forn(i, 100000)	if(!cnt[i])
		printf("%d  ", i);
	cout << endl << endl;

	forn(i, 21)	if(cnt[i])
		Pf("(%d, %*d)  ", i, count[i]);
	cout << endl << endl;

	int c = 0;
	forab(i, 1, 20)	if(cnt[i])
		c++, Pf("(%d, %d)  ", i, c);

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int par[1000100];
int num[1000100];
char  a[1000100] = {'\0'};

int main()
{
	CL(par, -1);
	CL(num, -1);
	int n;
	cin >> n;

	num[4] = 4,	num[7] = 7;

	forab(i, 1, n)	if(num[i] > 0) {
		if(num[i+4] < 0)
			num[i+4] = 4,	par[i+4] = i;
		if(num[i+7] < 0)
			num[i+7] = 7,	par[i+7] = i;
	}

	if(num[n]< 0)
		cout << -1;
	else {
		int idx = 0;
		while(n > 0) {
			a[idx++] = '0' + num[n];
			n = par[n];
		}
		reverse(a, a+idx);
		printf("%s",a);
	}

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

bool f(int n) {
	if(n == 0)
		return true;
	if(n%10 == 4 || n % 10 == 7)
		return f(n/10);
	return false;
}

int main()
{
	ST s;
	cin >> s;
	int cnt = 0;
	forn(i, s.length())
		if(s[i] == '4' || s[i] == '7')
			cnt++;
	if(cnt == 0) {
		cout << "NO" << endl;
		return 0;
	}
	cout << (f(cnt) ? "YES\n" : "NO");

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	cin >> n;

	forn(i, n)
		Pf("%c", 'a' + i%4);

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

vi v;
vvi ans;

bool findSet() {
	auto a = v.begin(), b = v.end();

	if(a == v.end() || b == v.begin())	return false;
	b--;
	int x = *a, z = *b, y;
	if(x == z)	return false;

	v.erase(a);
	v.erase(b);
	auto c = v.begin();

	for(; c != v.end() && *c == x; c++);
	if(c == v.end())	return false;
	y = *c;
	if(y == z)		return false;
	v.erase(c);
	vi t = {x, y, z};
	ans.pb(t);

	return true;
}

bool f() {
	if(v.size() < 3)	return false;
	auto at = v.begin();
	int a = *at;
	v.erase(at);

	auto ct = v.end();
	ct--;
	v.erase(ct);
	int c = *ct;
	if(a == c)		return false;

	auto bt = v.begin();
	for(; bt != v.end() && *bt == a; bt++);
	if(bt == v.end())	return false;
	int b = *bt;
	v.erase(bt);

	vi tmp = {a, b, c};
	ans.pb(tmp);

/*
	for(auto &x : tmp) {
		write(x);
	}
	cout << endl;
*/
	return true;
}

int main()
{
	int n, tmp;
	cin >> n;
	forn(_n, n) {
		read(tmp);
		v.pb(tmp);
	}
	sort(all(v));

	while(f());
	writeln(ans.size());
	for(auto &a : ans) {
		for(auto &x : a)
			write(x);
		Pf("\n");
	}
/*
	while(findSet());

	cout << ans.size() << endl;
	for(auto &r : ans) {
		for(auto &s : r)
			write(s);
		Pf("\n");
	}
*/
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n, R, r;
	cin >> n >> R >> r;

	if(n == 1)
		cout << (r <= R ? "YES" : "NO");
	else
		cout << ((R >= 2*r && 2*PI*(R-r) >= 2*n*r) ? "YES" : "NO") ;

	return 0;

	if(n == 1)
		cout << (r <= R ? "YES" : "NO");
	else
		cout << (PI*(R-r) >= n*r ? "YES" : "NO");
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

map <int, int> m;
vvi ans;

void process(map <int, int> :: iterator it){
	it->second--;
	if(it->second == 0)
		m.erase(it);
}

bool find() {
	auto at = m.begin();
	if(at == m.end())	return false;
	int a = at->first;

	auto bt = at;
	bt++;
	if(bt == m.end())	return false;
	int b = bt->first;

	auto ct = bt;
	ct++;
	if(ct == m.end())	return false;
	int c = ct->first;

	process(at);
	process(bt);
	process(ct);
	vi tmp = {a, b, c};
	ans.pb(tmp);

	return true;
}

int main()
{
	int n, tmp;
	read(n);

	forn(_n, n) {
		read(tmp);
		m[tmp]++;
	}
/*
	for(auto &x: m)
		Pf("%d: %d\n", x.first, x.second);
*/
	while(find());

	writeln(ans.size());
	for(auto &x : ans) {
		for(auto &a : x)
			write(a);
		Pf("\n");
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

bool a[1000000] = {false};
int d;

void process(int k) {
	int idx = k;
	for(; idx <= d; idx+=k)
		a[idx] = true;
}

int main()
{
	int k, l, m, n;
	cin >> k >> l >> m >> n >> d;

	process(k);
	process(l);
	process(m);
	process(n);

	int ans = 0;

	forab(i, 1, d)
		ans += (a[i]  ? 1 : 0);
	cout << ans << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

inline double mod(double a) {
	return a<0.0 ? -a : a;
}

int main()
{
	double vp, vd, tt, f, c;
	cin >> vp >> vd >> tt >> f >> c;

	double princes = tt*vp, dragon = 0;
	double t, d, v;
	int cnt = 0;

	if(vd - vp <= 0.5) {
		cout << 0 << endl;
		return 0;
	}

	while(true) {
		v = vd - vp;
		d = princes;
		t = d/v;

		princes += vp*t;
//		cout << princes << " ";

		if(mod(princes - c) <= ep || princes >= c)
			break;

		cnt++;
		d = princes;
		t = d / vd  + f;
		princes += vp*t;
//		cout << princes << " ";
	}
//	cout << endl;
	cout << cnt << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define Pf		printf
#define	Sf		scanf

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	all(c)		(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int a, b, ans =0, c = 0;

	cin >> a >> b;

	while(b--) {
		ans+=a>>1;
		c += a&1;
		!(c^ 2) && ++ans && (c = 0);
	}
	cout << ans << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define Pf		printf
#define	Sf		scanf

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	all(c)		(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST st;
	cin >> st;
	map<char, int64> m;
	tr(it, st)
		m[*it]++;
	int64 ans = 0;

	tr(it, m)
		ans += it->second * it->second;

	cout << ans << endl;
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n, day[7], sum = 0;

	cin >> n;
	forn(i, 7) {
		cin >>  day[i];
		sum += day[i];
	}

	while(true) {
		if(n - sum <= 0)	break;
		n -= sum;
	}

	forn(i, 7) {
		if(n - day[i] <= 0) {
			cout << i+1 << endl;
			break;
		}
		else
			n -= day[i];
	}

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int dig[10] = {}, a[10] = {}, b[10] = {};

int count() {
	int ans = 0;
	forn(i, 10) {
		int j = 9-i;
		if(i+j == 9 && a[i] && b[j]) {
			ans += min(a[i], b[j]);
/*
			int t = min(a[i], b[j]);
			a[i] -= t;	b[j] -= t;
	
			ans+= t;

			a[i] += t;	b[j] += t;
*/
		}
	}
	return ans;
}

int main()
{
	ST st;
	ST aa = "", bb = "";

	cin >> st;
	forn(i, st.size()) {
		int id = st[i] - '0';
		dig[id] ++;	a[id]++;	b[id]++;
	}
	int ans = 0;

	forn(i, 10)	forn(j, 10)	if(i+j == 10 && a[i] && b[j]) {
		a[i]--;	b[j]--;

		int t = 1;
		t += count();

		if(t > ans)
			ans = t;

		a[i]++;	b[j]++;
	}

	aa = st;	bb = st;
	forn(i, 10)	forn(j, 10)	if(i+j == 10 && a[i] && b[j]) {
		a[i]--;		b[j]--;
		int t = 1;
		t += count();

		if(t == ans) {
			aa = "";		bb = "";
			aa += char('0' + i);
			bb += char('0' + j);

			forn(i, 10) {
				int j = 9-i;
				if(i+j == 9 && a[i] && b[j]) {
					int t = min(a[i], b[j]);
					aa += char('0' + i);
					bb += char('0' + j);
					a[i] -= t;
					b[j]-= t;
/*
					int t = min(a[i], b[j]);
					a[i] -= t;	b[j] -= t;
	
					ans+= t;

					a[i] += t;	b[j] += t;
*/
				}
			}

			forn(i, 10) {
				forn(_l, a[i])
					aa += char('0' + i);
				forn(_l, b[i])
					bb += char('0' + i);
			}

			break;
		}
	}
	reverse(all(aa));
	reverse(all(bb));

	cout << aa << endl << bb ;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

bool inline isVowel(char &ch) {
	return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' ) ? true : false;
}

ST f(ST &s, int k) {
	k--;
	rep(i, s.size() - 1, 0) {
		if(isVowel(s[i])) {
			if(k == 0)
				return s.substr(i);
			else
				k--;
		}
	}
	return "--";
}

int main()
{
	int n, k;
	ST st[4], ans[4];
	ST a, t;

	while(cin >> n >> k) {
		a = "aaaa\n";
		forn(_n, n) {
			forn(i, 4) {
				cin >> st[i];
				ans[i] = f(st[i], k);
//				cout << st[i] << " - " << ans[i] << endl;
			}
			if(ans[0] == "--" || ans[1] == "--" || ans[2] == "--" || ans[3] == "--" )
				t = "NO\n";
			else if(ans[0] == ans[1] && ans[0] == ans[2] && ans[0] == ans[3])
				t = "aaaa\n";
			else if(ans[0] == ans[1] && ans[2] == ans[3])
				t = "aabb\n";
			else if(ans[0] == ans[2] && ans[1] == ans[3])
				t = "abab\n";
			else if(ans[0] == ans[3] && ans[1] == ans[2])
				t = "abba\n";
			else
				t = "NO\n";
			
			if(a == "NO")	continue;
			
			if(a == "aaaa\n" || a == t)
				a = t;
			else 
				a = "NO\n";
		}
		cout << a ;
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

ii forbidden;
int N;
vvi G;
int cnt[222];

int dfs(int u, int par = -1) {
	if(cnt[u] > -1)
		return cnt[u];
	
	cnt[u] = 0;
	for(auto &v: G[u]) {
		if(v != par)
			cnt[u] = max(cnt[u], 1+ dfs(v));
	}
	return cnt[u];
}

int main()
{
	G.clear();
	cin >> N;
	G.resize(N);
	vector <ii> v;

	forn(i, N-1) {
		int a, b;
		cin >> a >> b;
		a--;	b--;
		if(a > b)
			swap(a, b);

		G[a].pb(b);
		G[b].pb(a);
		v.pb(mp(a, b));
	}

	for(auto &x: v) {
		CL(cnt, -1);
		forbidden = x;
	}


	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

#define X first
#define Y second
typedef pair <int64, int64> pt;

struct line {
	pt a, b;
	line (pt x, pt y) {
		a = x,  b = y;
	}
};

bool isLine(line l) {
	if(l.a.X == l.b.X)
		return l.a.Y - l.b.Y != 0;
	if(l.a.Y == l.b.Y)
		return l.a.X - l.b.X != 0;
	return false;
}

bool isParallel(line l1, line l2) {
	if(!isLine(l1))
		return false;
	if(!isLine(l2))
		return false;

	if(l1.a.X == l1.b.X)
		return min(l1.a.Y, l1.b.Y) == min(l2.a.Y, l2.b.Y) && max(l1.a.Y, l1.b.Y) == max(l2.a.Y, l2.b.Y);

	if(l1.a.Y == l1.b.Y)
		return min(l1.a.X, l1.b.X) == min(l2.a.X, l2.b.X) && max(l1.a.X, l1.b.X) == max(l2.a.X, l2.b.X);

	return false;
}

int main()
{
	vector <line> l;

	forn(i, 4) {
		int64 a, b, c, d;
		cin >> a >> b >> c >> d;
		line ll = line(mp(a, b), mp(c, d));
		l.pb(ll);
	}

	if(isParallel(l[0], l[1]) && isParallel(l[2], l[3]))
		cout << "YES";
	else if(isParallel(l[0], l[2]) && isParallel(l[1], l[3]))
		cout << "YES";
	else
		cout << "NO";
	cout << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	double d = 123.2398739872;
	string s = to_string(d);
	cout << d << endl;
	return 0;
}

#define CL(a, b)        memset(a, b, sizeof(a))
#define mp              make_pair

#define PI              M_PI
#define E               M_E
#define ep              1e-9
#define Sf              scanf
#define Pf              printf

#define pb              push_back
#define tr(i, c)        for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define present(x, c)   ((c).find(x) != (c).end())      //map & set//
#define cpresent(x, c)  (find( (c).begin(), (c).end(), x) != (c).end()) //vector & list//

#define forn(i, n)      for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)  for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)    for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long               int64;
typedef vector<int>             vi;
typedef string                  ST;
typedef stringstream            SS;
typedef vector< vector<int> >   vvi;
typedef pair<int,int>           ii;
typedef vector<string>          vs;

#define all(c)          (c).begin(), (c).end()
#define read(n)         scanf("%d", &n)
#define write(n)        printf("%d ", n)
#define writeln(n)      printf("%d\n", n)

int main()
{
        int n, m;

        cin >> n >> m;
        if(n == 1 || m == 1)
			cout << n*m << endl;
        else if(n <= 2 && m <= 2)
                cout << n*m << endl;
        else if((n*m) % 2 == 0)
                cout << n*m/2 << endl;
        else
                cout << (n+1)/2*(m+1)/2 + (n-1)/2*(m-1)/2 << endl;
        return 0;
}
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n, m;

	cin >> n >> m;
	if(n == 1 || m == 1)
		cout << n*m << endl;
	else if(n <= 2 && m <= 2)
		cout << n*m << endl;
	else if((n % 2 == 1  || m % 2 == 1) && (n*m)%2==0 )
		cout << n*m/2+1 << endl;
//		cout << (n%2==0 ? n : n+1) * (m%2==0 ? m : m+1)/2 << endl;
	else if((n*m) % 2 == 0)
		cout << n*m/2 << endl;
	else
		cout << (n*m+1)/2 << endl;
//		cout << (n+1)/2*(m+1)/2 + (n-1)/2*(m-1)/2 << endl;
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	vi v = {1, 2, 3, 4, 5, 6, 7, 8, 9};
	bool f = false;
	int r1, r2, c1, c2, d1, d2;
	cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;

	do {
		if(v[0]+v[1]==r1 && v[2]+v[3]==r2 && v[0]+v[2]==c1 && v[1]+v[3]==c2 && v[0]+v[3]==d1 && v[1]+v[2]==d2 )
		{
			f = true;
			break;
		}

	} while(next_permutation(all(v)));

	if(f) {
		Pf("%d %d\n%d %d", v[0], v[1], v[2], v[3]);
	}
	else
		cout << -1 << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	bool arr[1001][1001] = {};
	CL(arr, -1);
	int ans = 0;
	int n, m;
	cin >> n >> m;
	if(n < m)
		swap(n, m);

	int X[] = { 1,  1, -1, -1,  2,  2, -2, -2};
	int Y[] = { 2, -2,  2, -2,  1, -1,  1, -1};

	forn(x, n) {
		forn(y, m) {
			Pf("(%d, %d) = %d -> ", x, y, (arr[x][y] ? 1  : 0));
			if(arr[x][y]) {
				ans++;
				forn(i, 8) {
					if(x + X[i] >= 0 && x + X[i] < n && y + Y[i] >= 0 && y + Y[i] < m) {
						arr[x+X[i]][y + Y[i]] = false;
						Pf("(%d, %d) ", x + X[i], y + Y[i]);
					}
				}
			}
			cout << endl;
		}
	}

	cout << endl;
	forn(x, n) {
		forn(y, m) {
			cout << (arr[x][y] ? 1 : 0 ) << " ";
		}
		cout << endl;
	}

	cout << ans << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

void print(ST& num, ST & dec) {
	cout << "$" << num << "." << dec ;
}

void print(ST &num, ST &dec, bool neg) {
	if(neg) {
		cout << "(";
		print(num, dec);
		cout << ")";
	}
	else
		print(num, dec);
}

int main()
{
	ST st;
	bool neg = false;
	char num[1000] ={}, dec[1000] = {};
	
	Sf("%[^.\n]", num);
	if(num[0] == '-') {
		st =  string(num+1);
		neg = true;
	}
	else
		st = string(num);

	ST ans = "";
	reverse(all(st));

	forn(i, st.size()) {
		ans += st[i];
		if((i+1)%3==0 && i+1 != st.size())
			ans += ",";
	}
	reverse(all(ans));
//	cout << ans << endl;

	Sf("%[^\n]", dec);
	ST d;
	if(strlen(dec+1)==0) {
		d = "00";
	}
	else {
		d = string(dec+1);
		if(d.size() > 2)
			d = d.substr(0, 2);
		if(d.size() == 1)
			d += "0";
	}

	print(ans, d, neg);

//	cout << dec+1 << endl << strlen(dec+1);

//	cout << dec << endl;




	

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

#define valid(i)	(i >= 0 && i <= 9)

int main()
{
	int n, k, ans = -1, cost , m[10];
	CL(m, 0);
	ST st;

	cin >> n >> k >> st;

	forn(i, st.length())
		m[st[i] - '0']++;

	int toChange = -1;
	int minCost = -1;

	forn(i, 10)	if(m[i] >= k) {
		cout << 0 << endl << st << endl;
		return 0;
	}

	forn(i, 10)
		Pf("%d -> %d\n", i, m[i]);

	forn(i, 10) {
		int cnt = m[i];
		int cost = 0;

		forab(j, 1, 9) {

			Pf("i=%d, j = %d, k= %d, cnt = %d, cost = %d, mincost = %d\n", i, j, k, cnt, cost, minCost);

			if(cnt >= k)
				if(minCost == -1 || minCost > cost) {
					minCost = cost;
					toChange = i;
					break;
				}

			if(valid(i + j)) {
				int p = i+j;
				int f = min(k - cnt, m[p] - cnt);

				if(cnt + m[p] >= k) {
					f = k - cnt;
					cnt = k;
				}
				else
				{
					cnt += m[p];
					f = m[p];
				}


				assert(f >= 0);
				cnt += f;
				cost += j*f;
			}

			if(valid(i - j)) {
				int p = i-j;

				int f = min(k - cnt, m[p] - cnt);
				if(cnt + m[p] >= k) {
					f = k - cnt;
					cnt = k;
				}
				else
				{
					cnt += m[p];
					f = m[p];
				}

				assert(f >= 0);
				cnt += f;
				cost += j*f;
			}
		}
	}

	cout << minCost << endl << toChange << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

int n, m;
bool vis[11000];
int path[11000];

bool dfs(int a, int par, int cnt, vvi &G) {
	if(vis[a]) {
		if(cnt == n && a == 1)
			return true;
		return false;
	}

	vis[a] = true;
	forn(i, G[a].size())	if(G[a][i] != par) {
		if(dfs(G[a][i], a, cnt+1, G)) {
			path[cnt] = a;
			return true;
		}
	}

	vis[a] = false;
	return false;
}

int main()
{
	cin >> n >> m;
	vvi G(n+1);
	set< pair<int, int> > edge;

	forn(i, m) {
		int a, b;
		scanf("%d %d", &a, &b);
		G[a].pb(b);
		G[b].pb(a);
		edge.insert(mp( min(a, b), max(a, b) ));
	}

	CL(vis, 0);
	
	if(dfs(1, -1, 0, G)) {
		forn(i, n-1)
			Pf("%d %d\n", path[i], path[i+1]), 	edge.erase(mp(min(path[i], path[i+1]), max(path[i], path[i+1])));
		Pf("%d %d\n", path[n-1], 1);
		edge.erase(mp(1, path[n-1]));
		tr(it, edge)
			Pf("%d %d\n", it->first, it->second);
	}
	else
		Pf("0");

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

inline bool isVowel(char ch) {
	return ch == 'y' || ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
}

int main()
{
	ST st;
	cin >> st;

	forn(i, st.length()) {
		st[i] = tolower(st[i]);
		!isVowel(st[i]) && printf(".%c", st[i]);
	}

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

#define mod 100000000
//int Ans[101][11][101][11][2];
int Ans[110][110][2];

int aMax, bMax;

int f(int aLeft, int bLeft, bool chance)
{
	int &ans = Ans[aLeft][bLeft][chance];

	if(ans >= 0){
//		Pf("aLeft = %d, bLeft = %d, ans = %d\n", aLeft, bLeft, ans);
		return ans;
	}
/*
	if(aLeft == 0) 
		return (ans = bLeft > bMax ? 0 : 1);
	
	if(bLeft == 0)
		return (ans = aLeft > aMax ? 0 : 1);
*/
	ans = 0;

	if(chance) {
		if(bLeft == 0)
		{
			ans = aLeft <= aMax ? 1 : 0;
			return ans;
		}
		else {
			int limit = min(aLeft, aMax);

			forab(a, 1, limit) {
				ans += f(aLeft - a, bLeft, !chance);
				ans %= mod;
			}
		}
	}

	else {
		if(aLeft == 0) {
			ans = bLeft <= bMax ? 1 : 0;
		}
		else {
			int limit = min(bLeft, bMax);

			forab(b, 1, limit) {
				ans += f(aLeft , bLeft - b, !chance);
				ans %= mod;
			}
		}
	}


//	Pf("aLeft = %2d, aMax = %2d, bLeft = %2d, bMax = %2d, ans = %2d\n", aLeft, aMax, bLeft, bMax, ans);
	return ans;
}

int main()
{
	int aLeft,  bLeft;

	cin >> aLeft >> bLeft >> aMax >> bMax;
//	cin >> aMax >> bMax >> aLeft >> bLeft;

	int ans = 0;
	CL(Ans, -1);
	ans += f(aLeft, bLeft, true);

	//cout << endl;

//	CL(Ans, -1);
	ans += f(aLeft, bLeft, false);

	cout << ans % mod << endl;


	return 0;
}

#include <iostream>
#include <set>
#include <list>
#include <map>
#include <vector>
#include <cstdio>
using namespace std;

#define forab(i, a, b)	for(int i = (a), _loop_ends_here = (b); i <= (_loop_ends_here); (i)++)
#define forn(i, a)	forab(i, 0, (a)-1)
#define mp(a, b)	make_pair((a), (b))
#define read(n)		scanf("%d", &(n))
#define tr(it, v)	for( typeof((v).begin()) it = (v).begin(); it != v.end(); it++ )
#define all(v)		(v).begin(), (v).end()

void dfs(int a, vector < set<int> > &out, list <int> &order, vector <bool> &vis) {
	if(vis[a])
		return;
	vis[a] = true;

	tr(it, out[a])	if(!vis[*it])
		dfs(*it, out, order, vis);
			
	order.push_front(a);
}

void dfs_rev(int a, vector < set<int> > &in, vector <bool> &vis, vector < pair<int, int> > &ans) {
	if(vis[a])	return;

	vis[a] = true;

	tr(it, in[a])	if(!vis[*it])
		dfs_rev(*it, in, vis, ans), 	ans.push_back(mp(a, *it));
}

int main() {
	int n, m;
	cin >> n >> m;
	vector <set<int> > in(n+1), out(n+1);
	vector <bool> vis(n+1, false);
	list <int> order;
			
	forn(i, m) {
		int a, b;
		read(a);
		read(b);
		in[a].insert(b);
		in[b].insert(a);
		out[a].insert(b);
		out[b].insert(a);
	}

	forab(i, 1, n)	if(!vis[i])
		dfs(i, out, order, vis);

	tr(it, order)
		cout << *it << " ";
	cout << endl;

	fill(all(vis), false);
	vector < pair<int, int> > ans;
	ans.clear();

	dfs_rev(order.front(), in, vis, ans);

	forab(i, 1, n)	if(!vis[i]) {
		cout << 0 << endl;
		return 0;
	}

	tr(it, ans) 
		printf("%d %d\n", it->first, it->second);

	return  0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)
#define read(a)		scanf("%d", &(a))

bool vis[11000];
int path[11000];
int n, m;

bool dfs(int a , int cnt , const vvi &G, int par ) {
	if(a!= 1 && vis[a] == true)
		return false;
/*
	Pf("a = %d, vis[%d] = %d, cnt = %d, n = %d\n", a, a, vis[a], cnt, n);
	forn(i, cnt)
		Pf("(%d, %d) -> ", path[i], vis[i]);
	cout << a << endl;
*/
	if(a == 1  && cnt == n) {
/*		cout << "Path found: ";
		forn(i, cnt)
			Pf("%d ", path[i]);
		cout << endl;
*/
		forn(i, cnt-1)
			Pf("%d %d\n", path[i], path[i+1]);
		Pf("%d 1\n", path[cnt-1]);

		return true;
	}

	vis[a] = true;
	path[cnt] = a;
	
	tr(it, G[a])	if(*it != par) {
		if(dfs(*it, cnt+1, G, a))
			return true;
	}

	vis[a] = false;
	return false;
}

int main()
{
	cin >> n >> m;
	vvi G(n+1);
	CL(vis, 0);

	forn(i, m) {
		int a, b;
		read(a),	read(b);
		G[a].pb(b),	G[b].pb(a);
	}
/*
	forn(i, G.size()) {
		cout <<  i << " -> " ;
		tr(it, G[i])
			cout << *it << " ";
		cout << endl;
	}
*/
	if(!dfs(1, 0, G, -1))
		cout << 0 << endl;


	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

#define valid(n)	(n >= 0 && n <= 9)

int main()
{
	int minCost = -1, toChange = -1	;
	int n, k;

	ST st;

	cin >> n >> k >> st;

	int m[10];
	CL(m, 0);

	forn(i, st.length())
		m[st[i]-'0']++;

	forn(i, 10)	if(m[i] >= k)	{
		cout << 0 << endl << st << endl;
		return 0;

	}

	minCost = toChange = -1;

	forab(i, 0, 9) {
		//cout << endl;
		int curCost = 0, count = min(m[i], k);

		forab(j, 1, 9) {

			if(count < k && valid(i - j)) {
				int p = i-j;


				int req = k - count;
				int change = min(req, m[p]);

				assert(change >= 0);

				curCost += j*change;
				count += change;

			//	Pf("i = %d, p = %d, change = %d, costAdd = %d, curCost = %d\n", i, p, change, j*change, curCost);
			}

			if(count < k && valid(i + j)) {
				int p = i+j;

				int req = k - count;
				int change = min(req, m[p]);

				assert(change >= 0);

				curCost += j*change;
				count += change;
			//	Pf("i = %d, p = %d, change = %d, costAdd = %d, curCost = %d\n", i, p, change, j*change, curCost);
			}

			assert(count <= k);

			if(count == k && (minCost == -1 || minCost > curCost)) {
				minCost = curCost;
				toChange = i;
			}
		}
	}

//	cout << minCost << endl << toChange << endl;

	int req = k - m[toChange];

	forab(i, 1, 9) {
		if(req <= 0)	break;

		if(valid (toChange - i)) {
			char p = toChange - i + '0';

//			forn(j, st.length()) {
			rep(j, st.length()-1, 0) {
				if(req <= 0)	break;

				if(st[j] == p) {
					st[j] = toChange + '0';
					req--;
				}
			}
		}
		if(valid (toChange + i)) {
			char p = toChange + i + '0';

//			rep(j, st.length()-1, 0) {
			forn(j, st.length()) {
				if(req <= 0)	break;

				if(st[j] == p) {
					st[j] = toChange + '0';
					req--;
				}
			}
		}

	}
	assert(req == 0);
	cout << minCost << endl << st << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, loop_ends_here = (int)n; i < loop_ends_here; i++)
#define forab(i, a, b)	for(int i = a, loop_ends_here = (int)b; i <= loop_ends_here; i++)
#define rep(i, a, b)	for(int i = a, loop_ends_here = (int) b; i>=loop_ends_here; i--)

int N;

void Print(int n) {

	forn(i, N-n)
		cout << "  ";

	if(n == 0) {
		cout << n << endl;
		return ;
	}

	forab(i, 0, n) {
		cout << i << " ";
	}
	rep(i, n-1, 1)
		cout << i << " ";
	cout << "0\n";
}

int main()
{
	cin >> N;

	forn(i, N+1)
		Print(i);
	rep(i, N-1, 0)
		Print(i);

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

vs path;

void printpath() {
	if(path.size() == 0) {
		cout << "/\n";
		return;
	}
	for(auto &s: path)
		cout << "/" << s;
	cout << "/\n";
}

void cd(char st[]) {
	if(st[0] == '/') 
		path.clear();
	char *p = strtok(st, "/");
	if(p != nullptr) {
		ST s(p);
		if(s == ".");
		else if (s == "..")
			path.pop_back();
		else
			path.pb(s);
	}
	while( (p = strtok(nullptr, "/") ) != nullptr) {
		ST s(p);
		if(s == ".");
		else if (s == "..")
			path.pop_back();
		else
			path.pb(s);
	}
}

int main()
{
	char st[1111], *p, delim[] = "/";
	path.clear();

	int n ;
	cin >> n;
	while(n--) {
		ST s1;
		cin >> s1;
		if(s1 == "pwd")
				printpath();
		else {
			cin >> st;
			cd(st);
		}
	}
/*
	while(cin >> st) {
		cout << st << "  ->  ";
		p = strtok(st, delim);
		if(p != nullptr)
			cout << p << " ";
		while( (p = strtok(nullptr, delim)) != nullptr )
			cout << p << " ";
		cout << endl;

	}
*/	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 30000;
int arr[sz], rem[sz];

int main()
{
	int n;
	read(n);

	int ret = 0;
	forn(i, n) {
		read(arr[i]);
		ret += arr[i];
	}

	forab(k, 2, n-1)	if(n % k == 0 && n / k >= 3) {
		CL(rem, 0);
		forn(i, n)
			rem[i%k] += arr[i];
		forn(i, k)
			ret = max(ret, rem[i]);
	}
	writeln(ret);
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int k;
	read(k);
	ST ts;
	cin >> ts;

	ST s(k*ts.size(), '-');
	vector <bool> in(k*ts.size(), true);

	forn(_k, k)
		forn(i, ts.size())
			s[ts.size()*_k+i] = ts[i];

	vvi v('z' - 'a' + 1);

	forn(i, s.size())
		v[s[i]-'a'].pb(i);

	int n;
	read(n);

	while(n--) {
		int id;
		char ch;
		Sf("%d %c", &id, &ch);
		id--;
//		in[v[ch-'a'][id]] = false;
		vector <int> :: iterator it = v[ch - 'a'].begin() + id;
		in[*it] = false;
		v[ch - 'a'].erase(it);
	}

	forn(i, s.size())
		if(in[i])
			Pf("%c", s[i]);
	cout << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n, d;
	cin >> n >> d;
	
	map < pair<ST, ST>, int> m;
	set <pair<ST, ST> > ans;

	while(n--) {
		ST a, b;
		int t;
		cin >> a >> b >> t;

		int t1 = max(t, m[mp(a, b)]);

		m[mp(a, b)] = t1;

		auto it = m.find(mp(b, a));
/*
		cout << a << " " << b << " " << t << endl;
		if(it == m.end())
			cout << "No previsous entry.\n";
		else
			cout << b << " " << a << " " << it->second << endl;
		cout << endl;
*/
		if(it != m.end() && t - it->second <= d && t - it->second > 0) {
			ST aa = a, bb = b;
			if(aa > bb)
				swap(aa, bb);
			ans.insert(mp(aa, bb));
		}
	}

	cout << ans.size() << endl;
	for(auto &x : ans)
		cout << x.first << " " << x.second << "\n";
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int SZ = 2001;
int Palin[SZ][SZ];
int cntl[SZ], cntr[SZ];
ST s;
int sz;

int palin(int x, int y) {
	assert(x >= 0 && y >= x && y < sz);

	int &ret = Palin[x][y];

	if(ret > -1)
		return ret;

	if(y - x < 2)
		return ret = (s[x] == s[y] ? 1 : 0);

	if(s[x] == s[y] && palin(x+1, y-1))
		return ret = 1;
	return ret = 0;
}

int main()
{
	CL(Palin, -1);
	cin >> s;
	sz = s.size();
	
	forn(i, sz)
		forab(j, i, sz-1)
			if(palin(i, j))
				cntr[i]++,	cntl[j]++;

//	forn(i, sz)
//		Pf("%d \t (->) %d, \t (<-) %d\n", i, cntr[i], cntl[i]);

	int64 ans = 0;
	forn(i, sz-1)
		forab(j, i+1, sz-1)
			ans += (1ll*cntl[i])*cntr[j];

	cout << ans << endl;
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int64 ht = 0;
vector <pair <int64, int>> idx1, idx2;
int c1 = -1, c2 = -1, id1 = -1, id2 = -1;

void cal(int a, vector <pair <int64, int> > &v1, int b, vector <pair <int64, int> > &v2) {
	if(a < 0 || b < 0 || a >= v1.size() || b >= v2.size())
		return;

	if(v1[a].second == v2[b].second)
		return;

	if(v1[a].first + v2[b].first < ht)
		return;

	ht = v1[a].first + v2[b].first;
	id1 = a;	id2 = b;
	c1 = v1[a].second;	c2 = v2[b].second;
}

int main()
{
	int n;
	read(n);
	map <int, vector<pair<int64, int> > > m;

	forab(i, 1, n) {
		int c, s;
		Sf("%d %d", &c, &s);

		m[c].pb(mp(s, i));
	}

	for(auto &x : m) {
		vector <pair<int64, int>> &v = x.second;
		sort(all(v), greater<pair<int64, int>>());

		forn(i, v.size()) {
			if(i > 0)
				v[i].first += v[i-1].first;

			if(i == idx1.size())
				idx1.pb(v[i]);
			else if(i == idx2.size())
				idx2.pb(v[i]);
			else if(v[i] >= idx1[i] ) {
				swap(idx1[i], idx2[i]);
				idx1[i] = v[i];
			}
			else if(v[i] > idx2[i])
				idx2[i] = v[i];
		}
	}

	forn(i, idx1.size()) {
		cal(i, idx1, i, idx2);
		cal(i, idx1, i-1, idx2);
		cal(i, idx1, i+1, idx2);

		cal(i, idx1, i+1, idx1);
		cal(i, idx1, i-1, idx1);
	}

	forn(i, idx1.size()) {
		Pf("%d - %lld", i, idx1[i].first);
		if(i < idx2.size())
			Pf(", %lld", idx2[i].first);
		cout << endl;
	}

	cout << ht << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int k = 2000;
	ST s;
	s.reserve(500);

	forn(i, 100)
		s += 'a' + (rand() % 26);

	cout << s << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1001;
int A[sz][sz], B[sz][sz], dcap[sz], dpen[sz];

int main()
{
	int n, m, d, c;
	Sf("%d %d", &n, &m);

	forn(_n, n) {
		Sf("%d %d", &c, &d);
		dpen[d]++;
		A[d][c]++;
	}
	
	forn(_m, m) {
		Sf("%d %d", &c, &d);
		dcap[d]++;
		B[d][c]++;
	}

	int ans1 = 0, ans2= 0;

	forn(i, sz) {
		ans1 += min(dcap[i], dpen[i]);
		forn(j, sz)
			ans2 += min(A[i][j], B[i][j]);
	}

	cout << ans1 << " " << ans2 << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e6;
int64 arr[sz];

int main()
{
	int64 N, K;
	cin >> N >> K;
	assert(N < sz);

	forn(i, N)
		cin >> arr[i];

	map <int64, int> cnt;
	int flag = 0;

	int64 l = 0, r = 0;
	cnt[arr[l]]++;
	int64 ans = 0;

	while(l < N) {
		while(r < N && cnt[arr[r]] < K) {
//			Pf("l = %lld, r = %lld, arr = %lld, cnt = %d\n", l, r, arr[r], cnt[arr[r]]);
			cnt[arr[++r]]++;
		}
		ans += N-r;
		Pf("(%lld, %lld) -> arr[%lld] = %lld, cnt = %d, add = %lld\n", l, r, r, arr[r], cnt[arr[r]], N - r);

		cnt[arr[l++]]--;
	}
	cout << ans << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	map <int64, vi> m;
	int64 N, K, tmp;
	cin >> N >> K;

	forn(i, N) {
		cin >> tmp;
		m[tmp].pb(i);
	}
	
	int64 ans = 0;
	for(auto &vv: m) {
		vi &v = vv.second;

		cout << vv.first << " : " ;
		for(auto &x: v)
			cout << x << " ";
		cout << endl;

		for(int i = 0; i < v.size(); i++) {
			if(i+K-1 < v.size())
				ans += N - v[i+K-1];
		}
		cout << ans << endl;
	}
	cout << ans << endl;
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

vs in;
int n;

bool check(int &idx) {
	if(idx == in.size())
		return false;

	if (in[idx] == "int") {
		idx++;
		return true;
	}

// in[i] == "pair"
	++idx;
	bool f1 = check(idx);
	bool f2 = check(idx);
	return f1 & f2;
}

void process(int &idx) {
	if(idx == in.size())
		return;
	if(in[idx] == "int") {
		cout << "int";
		idx++;
	}
	else {
		cout << "pair<";
		idx++;
		process(idx);
		cout << ",";
		process(idx);
		cout << ">";
	}
}

int main()
{
	cin >> n;
	ST st;
	while(cin >> st)
		in.pb(st);

	int idx = 0;
	if(!check(idx) || idx != in.size())
		cout << "Error occurred";
	else{
		idx = 0;
		process(idx);
	}
	
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

char cur = 'F';
int sz;
int maxAns = 0;
ST st;

void maxi(int a) {
	if(a > maxAns)	{writeln(a);
//	cout << st << endl;
	}
	maxAns = max(maxAns, a);
}

int ans[111][111];

int cal(int idx, int ans, int rem) {

	if(rem < 0) {
		cout << st << ", ";
		Pf("idx = %d, ans = %d, rem = %d\n", idx, ans, rem);
		return 0;
	}

	if(idx == sz) {
		cout << st << ", ";
		Pf("idx = %d, ans = %d, rem = %d\n", idx, ans, rem);
		return rem == 0 ? ans : 0;
	}


	cout << st << ", ";
	Pf("idx = %d, ans = %d, rem = %d\n", idx, ans, rem);
	if(rem == 0)	maxi(ans);

	maxi(cal(idx+1, (st[idx] == cur ? ans+1 : 0), rem) );

	for(int i = 2; i<=rem; i+=2) {
		maxi( cal(idx+1, (st[i] == cur ? ans+1 : 0), rem - i));
	}

	for(int i = 1; i<=rem; i+=2) {
		st[i] = 'T';
		maxi( cal(idx+1, (st[i] == cur ? ans+1 : 0), rem - i));
	}
}

int main()
{
	cin >> st;
	int n;
	cin >> n;
	sz = st.size();
//	cout << st << endl;

	cal(0, 0, n);
	cur = 'T';
//	cal(0, 0, n);
//	cout << maxAns << endl;
	cout << endl << maxAns << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int sz, ANS = 0, maxAns = 0;
ST st;
char cur = 'F';

void cal(int idx, int ans, int maxAns, int rem) {
	if(rem < 0)	return ;

	if(idx == sz) {
		if(rem == 0)	ANS = max(maxAns, ANS);
		return ;
	}

	int t;

	for(int i = 0; i<= rem; i+=2)


}

int main()
{
	cin >> st;
	sz = st.size();
	int rem;
	cin >> rem;

	cal(0, 0, 0, rem);
	cout << ANS << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	map <char, int> m;
	const int mod = 1000003;

	m['>'] = 8;
	m['<'] = 9;
	m['+'] = 10;
	m['-'] = 11;
	m['.'] = 12;
	m[','] = 13;
	m['['] = 14;
	m[']'] = 15;

	int ans = 0;

	ST st;
	cin >> st;

	forn(i, st.size()) {
		ans = (ans*16 + m[st[i]]) % mod;
	}
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/
#define DEBUG(x)	cout << #x << " = " << x << "\n"
#define endl		("\n")
#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n = 1e5;
	cout << n << endl;
	forn(i, n)
		cout << 1 << " " << 1 << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int a[500001], b[500001][3], d[500001], e[100001];
int didx, eidx;

int main()
{
	int n, x, k;
	
	while(cin >> n)
	{
		bool found = false, valid = true;;
		didx = eidx = 0;

		forab(i, 1, 3*n)
		{
			Sf("%d", &x);
			a[x] = i;
		}

		forab(i, 1, n)
		{
			forn(j, 3)
				Sf("%d", & b[i][j]);
		}

		cin >> k;
		forab(i, 1, n)
		{
			if(!valid)	break;

			forn(j, 3)
			{
				if(found)	e[eidx++] = b[i][j];
				else		d[didx++] = b[i][j];
			}

			if(b[i][0] == k || b[i][1] == k || b[i][2] == k)
			{
				found = true;
				forn(l, 3)	if(b[i][l] < k)
					valid = false;
			}
		}

		if(!valid)
		{
			forab(i, 1, 3*n)
				if(i^k)
					Pf("%d ", i);
			cout << endl;
			continue;
		}

		sort(d, d+didx);
		sort(e, e+eidx);

		forn(j, didx) if(k^d[j])	Pf("%d ", d[j]);
		forn(j, eidx) if(k^e[j])	Pf("%d ", e[j]);
		cout << endl;
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	ST s, h = "hello";

	while(cin >> s)
	{
		int j = 0;

		forn(i, s.length())
		{
			if(j == 5)	break;
			if(s[i] == h[j])	j++;
		}

		if(j == 5)	cout << "YES\n";
		else		cout << "NO\n";
	}
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;

	while(cin >> n)
	{
		int x = n;
		if(n == 1)
		{
			cout << 1 << endl;
			continue;
		}

		map < int, int > m;

		forab(i, 2, n)
		{
			while(n % i == 0)
			{
				m[i]++;
				n /= i;
			}
		}

		int mx = 0, el = 1;

//		cout << "For n = " << x << endl;

		tr(it, m)
		{
//			Pf("%d ->  %d \t ", it->first, it->second);

			if(it->second > mx)
			{
				mx = it->second;
				el = it->first;
			}
			else if(it->second == mx)
				el = max(el, it->first);
		}

//		Pf("\nElement = %d , occurance = %d\n\n", el, mx);

		int num = el;

		while(num * el <= x)
			num *= el;

		if(num != x)
			cout << x << ' ';

		while(num >= 1)
		{
			cout << num << ' ';
			num /= el;
		}

		cout << endl;

	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define INF 100000000

int a[100009], n;

int Cal(int idx)
{
	int ret = 0;

	forn(i, n)
	{
		if(a[idx] + i - idx <= 0)	return INF;

		if(a[idx] + i - idx != a[idx])	ret++;
	}
	return ret;
}

int main()
{
	int n;

	while(cin >> n)
	{
		forn(i, n)	Sf("%d", &a[i]);
		int ans = INF;

		forn(i, n)	ans = min(ans, Cal(i));

		cout << ans << endl;
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)


void Print(int k, int vis[])
{
	forab(i, 0, k)
		cout << i << " : " << vis[i] << endl;
	cout << endl;
}

int main()
{
	int vis[30];
	int k;
	ST st;

	while(cin >> k)
	{
//		cout << endl << endl;
		cin >> st;
//		cout << st << endl;
		--k;

		forn(i, 28)	vis[i] = 0;
		int len = st.length();

//		Print(k, vis);
		forn(i, len)	if(st[i] != '?')
		{
			int idxx = st[i] - 'a';
			vis[ idxx]  = 1;
		}

//		Print(k, vis);

		int idx = 0;

		bool f = true;
		
		idx = 0;

		rep(j, k , 0)	if(!vis[j])
		{
			idx = j;
		//	vis[idx] = 1;
			break;
		}

		if(f && len % 2 == 1 && st[len/2] == '?')
		{
			st[len/2] = idx + 'a';
			vis[idx] = 1;
		}

		rep(i, len/2 - 1, 0)
		{
			//cout << st << endl;
//			Print(k, vis);

			idx = 0;

			rep(j, k , 0)	if(!vis[j])	
			{
				idx = j;
				break;
			}

			if(st[i] == '?')
			{
				if(st[len - i - 1 ] == '?')
					st[len-i-1] = idx + 'a';
				st[i] = st[len-i-1] ;
				vis[idx] = 1;
			}
			else if(st[len-i-1] == '?')
			{
				st[len-i-1] = st[i];
			}
			else if( st[i] != st[len-i-1] )
			{
				f = false;
				break;
			}

		}


		if(f)	forab(i, 0, k)	if(!vis[i])
		{
			f = false;
			break;
		}

		if(f)
			cout << st << endl;
		else
			cout << "IMPOSSIBLE" << endl;
	}

	

	return 0;
}
//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e6;
int arr[sz];
map <int, vi> m;
int N, M, K;

int main()
{
	int tmp;
	int ans = 1;
	cin >> N >> M >> K;

	forn(i, N) {
		cin >> tmp;
		m[tmp].pb(i);
	}


	for(auto &x: m) {
/*
		cout << x.first << ": ";
		for(auto &y: x.second)
			cout << y << " ";
		cout << endl;
*/
		vi &v = x.second;
		int cnt = 1;
		int l = 0, r = 0, n = v.size(), k = K;

		while(l+1 < n) {
			while(r+1 < n && v[r+1] - v[r] -1 <= k) {
//				Pf("r+1 = %d, n = %d, v[r+1] = %d, v[r] = %d, k = %d\n", r+1, n, v[r+1], v[r], k);
				k -= v[r+1] - v[r] - 1;
				cnt++;
				ans = max(ans, cnt);
				r++;
			}
//			Pf("l = %d, r = %d, k = %d, cnt = %d, ans = %d\n", l, r, k, cnt, ans);
			ans = max(ans, cnt);
			k += v[l+1] - v[l] - 1;
			cnt--;
			l++;
		}
//		cout << endl;
//		ans = max(ans, cnt);
	} 
//	cout << endl;
	
	cout << ans << endl;
	
	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	ST d, st[10010];
	set <ST> s[15], ret;
	set <ST> :: iterator it, jt;
	int totLen = 0, lenPerLIne;

	cin >> n;

	forn(i, n)
	{
		cin >> st[i];

		totLen += st[i].length();
		s[st[i].length()].insert(st[i]);
	}

	lenPerLIne = totLen*2/n;

	cin >> d;
	
	forab(i, 1, (lenPerLIne)/2)
	{
		int j = lenPerLIne - i;
		if(i == j)	continue;

		it = s[i].begin();
		jt = s[j].begin();

		while(it != s[i].end() && jt != s[j].end())
		{
//			ST st1 = (*it) + d + (*jt), st2 = (*jt) + d + (*it);
//			cout << st1 << " \t " << st2 << endl;

			if( (*it) + d + (*jt) < (*jt) + d + (*it) )
				ret.insert( (*it) + d + (*jt) );
			else
				ret.insert( (*jt) + d + (*it) );
			it++;
			jt++;
		}

	}

	if( lenPerLIne % 2 == 0)
	{
		int i = lenPerLIne / 2;

		it = s[i].begin();
		jt = it;
		jt++;

		while(it != s[i].end() && jt != s[i].end())
		{
			ret.insert((*it) + d + (*jt));
			it++;
			it++;
			jt++;
			jt++;
		}
	}

//	forab(i, 1, lenPerLIne - 1)
	{
//		tr(it, s[i])
//			cout << *it << ' ';
//		cout << endl;
	}
	
	tr(it, ret)
		cout << *it << endl;

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n, x;

	while(cin >> n)
	{
		int ans = 0;
		vi even, odd;
		forn(i, n)
		{
			cin >> x;
			if(x%2 == 0)
				even.pb(x);
//				even+= x;
			else
				odd.pb(x);
//				odd += x;
		}

		ans = accumulate(all(even), 0);
		sort(all(odd));

		if(SZ(odd) == 0)
		{
			cout << 0 << endl ;
			continue;
		}

		else if(SZ(odd) % 2 == 0)
		{
			odd.erase(odd.begin());
		}
		ans += accumulate(all(odd), 0);

		cout << ans << endl;
	}
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define PI	3.141592653589793
#define E	2.718281828459045
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

//To the left of 2
//To the right of 1

int main()
{
	int n, m;
	int t;
	int l,r;
	ST st, sst;

	while(cin >> n >> m)
	{
		l = 1, r = n;
		forn(_m, m)
		{
			cin >> st >> st >> st >> sst >> t;
			if(st[0] == 'l')
				r = t-1;
			else
				l = t+1;

			
		}
//		cout << l << " - " << r << " \t ";
		if(r > n || l < 0 || r-l < 0)
			cout << -1 << endl;
		else
			cout << r-l+1 << endl;
//		cout << (r-l <0 ? -1 : r-l + 1) << endl;
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)
#define Sq(x)	(x*x)

struct Target {
	int x, r, hit, idx;
	Target() {
		hit = -1, idx = -1;
	}
	Target(int _x, int _r, int _idx) {
		x = _x, 	r = _r, 	hit = -1, 	idx = _idx;
	}
	void Print() {
		Pf(" {%d %d %d}\n", x, r, hit);
	}
};

bool operator < (const Target &a, const Target &b) {
	return a.x < b.x;
}

bool Less(const Target &a, const Target &b) {
	return a.idx < b.idx;
}

bool In(int x, int y, const Target &t) {
	int dist = (t.x - x)*(t.x - x) + y*y ;
//	Pf("x = %d, y = %d , t.x = %d, t.r = %d, dist = %d\n"  , x, y , t.x, t.r, dist );
	return dist <= Sq(t.r);
}

int main()
{
	int n, m, x, y, r, idx, cnt;

	while(~Sf("%d", &n)) {
		Target t[10010];
		cnt = 0;
		forn(i, n)
			Sf("%d %d", &x, &r), 	t[i].x = x, 	t[i].r = r, 	t[i].idx = i+1;
		sort(t, t+n);
/*
		forn(i, n)
			t[i].Print();
*/
		Sf("%d", &m);

		forn(i, m) {
			Sf("%d %d", &x, &y);
			idx = lower_bound(t, t+n, Target(x, 0, -1)) - t;


			if(idx-1 >= 0 && idx-1 < n) 
				if(t[idx-1].hit < 0)
					if(In(x, y, t[idx-1]))
						t[idx-1].hit = i+1, cnt++ /*, Pf("{%d %d} idx = %d ", x, y, idx-1), t[idx-1].Print()*/;
			if(idx >= 0 && idx < n)
				if(t[idx].hit < 0)
					if(In(x, y, t[idx]))
						t[idx].hit = i+1, cnt++ /*, Pf("x = %d , y = %d, idx = %d ", x, y, idx), t[idx].Print()*/;
		}

		sort(t, t+n, Less);

		cout << cnt << endl;
		forn(i, n)
			Pf("%d ", t[i].hit);

		cout << endl;
	}


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define	ep	1e-9
#define	CL(a, b)	memset(a, b, sizeof(a))

#define pb	push_back
#define mp	make_pair
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	ST st;

	while(cin >> st)
	{
		int lo = 0, up = 0;

		forn(i, st.length())
		{
			if(islower(st[i]))	lo++;
			else			up++;
		}

		forn(i, st.length())
		{
			if(up > lo)
				st[i] = toupper(st[i]);
			else	
				st[i] = tolower(st[i]);
		}
		cout << st << endl;
	}


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define PI	3.141592653589793
#define E	2.718281828459045
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

char g[15][15][15];
int vis[15][15][15];

int a[] = {-1, 1,  0, 0,  0, 0};
int b[] = { 0, 0, -1, 1,  0, 0};
int c[] = { 0, 0,  0, 0, -1, 1 };

int dfs(int l, int x, int y)
{
	if(vis[l][x][y] == 1)	return 0;
	vis[l][x][y] = 1;

	if(g[l][x][y] == -1)	return 0;

	if(g[l][x][y] == '#')	return 0;

	int ans = 1;

	forn(i, 6)
		ans += dfs(l+a[i], x + b[i], y + c[i]);

	return ans;


}

int main()
{
	int k, n, m, x, y;

	cin >> k >> n >> m;
	CL(g, -1);

	forab(_k, 1, k)		forab(_n, 1,  n)	forab(_m, 1, m)		cin >> g[_k][_n][_m];

	cin >> x >> y;

	cout << dfs(1, x, y);
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a%b);
}

int lcm(int a, int b) {
	return a*b/gcd(a, b);
}


int main()
{
	string her = "Hermione\n", ron = "Ron\n";
	int a, b, c, d, e, f, l;

	while(cin >> a >> b >> c >> d >> e >> f)
	{

		
		if(d == 0)
		{
			cout << her;
			continue;
		}
		if(c == 0)
		{
			cout << ron;
			continue;
		}
		if(b == 0)
		{
			cout << her;
			continue;
		}
		if(a == 0)
		{
			cout << ron;
			continue;
		}
		
		if(f == 0)
		{
			cout << her ;
			continue;
		}
		if(e == 0)
		{
			cout << ron ;
			continue;
		}

		int g =gcd(a, b);
		a/= g, b /= g;

		g = gcd(c, d);
		c /= g, d /= g;

		g = gcd(e, f);
		e /= g, f /= g;
//		Pf("%d->%d %d->%d %d->%d\n", a, b, c, d, e, f);


		l = lcm(b, c);
		a *= l/b;
		d *= l/c;
		b = c = l;

//		Pf("#1 a = %d , b = %d , c = %d , d = %d , e = %d , f = %d , l = %d\n", a,b, c, d, e, f,  l);

		l = lcm(d, e);
		c *= l / d;
		a *= l/d;
		b *= l/d;
		f *= l/e;
		d = e = l;
//		Pf("#2 a = %d , b = %d , c = %d , d = %d , e = %d , f = %d , l = %d\n", a,b, c, d, e, f,  l);

//		Pf("%d->%d %d->%d %d->%d\n", a, b, c, d, e, f);

		if(f > a)
			cout << ron ;
		else
			cout << her ;
	}
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

//#define PI	3.141592653589793
//#define E	2.718281828459045
#define PI	(2*acos(0))
#define E	(exp(1))
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	string fail = "No solution\n";
	

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n, ret = 1, idx = 0;
	bool f = false, newWord = true;
	ST st, word, tmp;
	vs sen;

	Sf("%d\n", &n);
	getline(cin, st);

	SS ss(st);

	st.clear();
	tmp.clear();
	word.clear();

//	vs :: iterator it = sen.begin();

	while(ss >> st)
	{

		if(st.length() > n)
		{
			f = true;
			break;
		}

		if(newWord)
		{
//			cout << "#1" << endl;

			newWord = false;
			sen.pb(st);
//			it++;
//			cout << "#2" << endl;
		}
		else
		{
//			cout << "#3" << endl;

			int i = SZ(sen)-1;

			sen[i] = sen[i] + " " + st;

//			*it = *it + " " + st;
//			cout << "#4\n";
		}
		
		char ch = st[st.length() -1];

		if(ch == '.' || ch == '?' || ch == '!')
			newWord = true;

//		cout << st.length() << " -> " << st << " ->" << ch << endl;
	}
/*
	tr(it, sen)
		cout << *it << endl;
*/

	int len = 0;
	st.clear();
	tmp.clear();

//	cout << n << endl;

	if(!f)	tr(it, sen)
	{
		tmp = st + " " + *it;

//		cout << tmp << endl;

		if(tmp.length() > n)
		{
//			cout << st << endl;

			ret++;
			st.clear();
			st = *it;
		}
		else if(st.length() == 0)
			st = st + *it;
		else
			st = st + " " + *it;
		if(st.length() > n)
		{
			f = true;
			break;
		}
	}

	if(st.length() > n)
		f = true;

//	cout << st << endl;

//	if(!f) tr(it, sen)
//		cout << it->length() << " -> " << *it << endl;

	if(f)
		cout << "Impossible\n";
	else
		cout << SZ(sen) << endl;


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int F(int x, int y)
{
	int a = 0, b = 0;

//	cout << x << " " << y << " -> ";

	while(x > 0)
	{
		a = a*10 + x%10;
		x /= 10;
	}

	while(y > 0)
	{
		b = b*10 + y%10;
		y /= 10;
	}

//	cout << a << " " << b << endl;

	return a*b;
}

int main()
{
	int x, y, maxX, maxY, w = 0, reqW;

	cin >> maxX >> maxY >> reqW;

	for(x = 1; x <= maxX; x++)
	{
		for(y = 1; y <= maxY; y++)
		{
			if(x * y == F(x, y))
			{
				cout << x << " " << y << endl;
				w++;
			}

			if(w >= reqW)
				goto out;
		}
	}

	out:

	cout << endl << endl;

	if(w < reqW)
		cout << -1 << endl;
	else
	{
		if(x > maxX)
			cout << maxX ;
		else
			cout << x;
		cout << " ";
		if(y > maxY)
			cout << maxY;
		else
			cout << y << endl;
	}


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define mod 1000003

int Process(int n) {
	return (n == 1 || n == 0 ? 1 : (3 * Process(n-1) % mod));
}

int main()
{
	int ret = 1;
	int n;

	cin >> n;

	cout << Process(n) << endl;
/*
	forn(i, n)
		ret = (ret * 3) % mod;

	cout << ret << endl;
*/
	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int F(int x, int y)
{
	int a = 0, b = 0;

//	cout << x << " " << y << " -> ";

	while(x > 0)
	{
		a = a*10 + x%10;
		x /= 10;
	}

	while(y > 0)
	{
		b = b*10 + y%10;
		y /= 10;
	}

//	cout << a << " " << b << endl;

	return a*b;
}

int main()
{
	int X = 1, Y = 1, w, reqW, maxX, maxY;
	w = 1;

	cin >> maxX >> maxY >> reqW;
/*
	while(w < reqW && X <= maxX && Y <= maxY)
	{

		forab(x, 1, X)
			if( (Y+1)*x == F(x, Y+1) )
			{
				cout << w+1 << " -> " <<  x << " , " << Y+1 << endl;
				w++;
			}

		Y += 1;

		if(w >= reqW)
			break;

		forab(y, 1, Y)
			if( (X+1) * y == F(y, X+1))
			{
				cout << (w+1) << " -> " <<  X +1 << " , " << y << endl;
				w++;
			}

		X += 1;

		if(w >= reqW)
			break;
	}
*/
	while(w < reqW && X <= maxX && Y <= maxY)
	{
		if( (X+1) * Y < (Y+1)* X || Y == maxY)
		{
			forab(y, 1, Y)
				if( (X+1)*y == F(X+1, y) )
					Pf("%d -> %d, %d\n", w+1, X+1, y),	 w++;
			++X;
		}
		else
		{
			forab(x, 1, X)
				if( (Y+1)* x == F(Y+1, x) )
					Pf("%d -> %d, %d\n", w+1, x, Y+1), 	w++;
			++Y;
		}


	}

	cout << endl << endl;

	if(X > maxX)
		X = maxX;
	if(Y > maxY)
		Y = maxY;

	if(w >= reqW)
		cout << X << " " << Y << endl;
	else
		cout << -1 << endl;

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	/*
	int p1, p2, p3, p4, a, b;
	vi p(4);

//	while(cin >> p1 >> p2 >> p3 >> p4 >> a >> b)
	while(cin >> p[0] >> p[1] >> p[2] >> p[3] >> a >> b)
	{
		vvi x (4) ;
		int idx =0;
		map <int, int> m;

		sort(all(p));
		do {
			forn(i, 4)
				x[idx].pb(p[i]);
			idx++;
		} while(next_permutation(all(p)));

		forn(i, 4)
		{
			tr(it, x[i])
				cout << *it << " \t ";
			cout << endl;
		}

	}
*/
/*
	vi x(4);
	int a, b;

	while(cin >> x[0] >> x[1] >> x[2] >> x[3] >> a >> b)
	{
		vvi p(24);
		sort(all(x));

		tr(it, x)
			cout << *it << " ";
		cout << endl;

		int idx = 0;

		do {
			tr(it, x)
				p[idx].pb(*it);

			idx++;
		}while( next_permutation(all(x))  ) ;

		int ret = 0;

		tr(it, p)
		{
			tr(jt, *it)
			{

				cout << *jt << " ";
			}
			cout << endl;

			//if()
		}
*/
		/*
		b = min(b, *min_element(all(p)) );
		forab(i, a, b)
		{
			int t = i, cnt = 0;
		//	tr(it, p)
			forn(i, 24)
			{
				t = i;
				forn(j, 4)
				{
					t = t%p[i][j];
				}
				Pf("i = %d  t = %d  \t  prime = {%d, %d, %d, %d}\n", i, t, p[i][0], p[i][1], p[i][2], p[i][3]);
				if(i==t)
					cnt++;
			}
			if(cnt >= 7)
			{
				ret++;
				break;
			}

		}

		cout << ret << endl;
	}
*/
	vi x(4);
	int a, b;

	while(cin >> x[0]>> x[1] >> x[2] >> x[3] >> a >> b)
	{
		b = min(b, *min_element(all(x)));

		vvi p;

		sort(all(x));

		do {
			p.pb(vi());
			int idx = SZ(p) -1;

			tr(it, x)
				p[idx].pb(*it);

		} while ( next_permutation(all(x)) ) ;
/*
		tr(it, p)
		{
			tr(jt, *it)
				cout << *jt << " ";
			cout << endl;
		}

		cout << SZ(p) << endl;
*/
		int ret = 0;

		forab(i, a, b)
		{
			int f , cnt = 0;

			forn(k, SZ(p))
			{
				f = i;
				forn(j, SZ(p[k]))
				{
					f = f % p[k][j];
				}

				if(f == i)
					cnt++;
			}

//			Pf("i = %d  , cnt == %d\n  ", i, cnt);
			if(cnt >= 7)
				ret++;
		}
		cout << ret << endl;
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector<vi> vvi;
typedef vector<ST> vs;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	double per;

	while(cin >> n >> per)
	{
		vector <double> x(n);
		forn(i, n)
			cin >> x[i];

/*		Pf("n = %d , per = ", n);
		tr(it, x)
			cout << *it << " ";
		cout << endl;
*/
		double l = 0, mid, r = 1000, great = 0, less = 0;
		per /= 100;

		forn(_test, 400)
		{
			great = less = 0;
			mid = (l+r)/2;

			tr(it, x)
			{
				if(*it > mid)
					great += (*it - mid);
				else
					less += (mid - *it);
			}

//			Pf("l = %.5lf , r = %.5lf , mid = %.5lf , great = %.5lf , less  = %.5lf \n", l, r, mid , great, less);

			if( (great - ( great * per )) >= less)
				l = mid;
			else
				r = mid;
		}
		Pf("%0.20lf\n", mid);
	}

	return 0;
}
//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n;
	cin >> n;
	vector <ii> a(n);

	forn(i, n) {
		int tmp;
		read(tmp);
		a[i] = mp(tmp, i+1);
	}
	sort(all(a));

	if(n%2 == 1) {
		cout << (n+1)/2 << endl;
		write(a[0]);
		for(int i = 1; i < a.size() ; i +=2)
			write(a[i]);
		cout << endl;
		cout << n/2 << endl;
		for(int i = 2; i < a.size() ; i+= 2)
			write(a[i]);
		cout << endl;
	}
	else {
		cout << n/2 << endl;
		for(int i = 0; i < a.size(); i+=2)
			write(a[i]);
		cout << endl;
		cout << n/2 << endl;
		for(int i = 1; i < a.size(); i += 2)
			write(a[i]);
	}
/*
	writeln((n+1)/2);
	for(int i = 0; i<a.size(); i+=2)
		write(a[i].second);
	cout << endl;

	writeln(n/2);
	for(int i = 1; i <a.size() ; i+=2)
		write(a[i].second);
	cout << endl;
*/
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int k;
	vi month(12);
	read(k);
	forn(i, 12)
		read(month[i]);

	sort(all(month), greater<int>());

	int ans = 0, cnt = 0;

	for(auto x : month) {
		if(ans >= k)
			break;
		ans += x;
		cnt ++;
	}
	cout << ((ans >= k) ? cnt : -1) << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

void trim(ST &s) {
	while(s.size() > 1 && s[0] == '0')
		s = s.substr(1);
}

int num(char ch) {
	return isdigit(ch) ? ch - '0' : ch - 'A' + 10;
}

int num(ST &n, int b) {
	int ans = 0, B = 1, tmp;

	rep(i, n.size() - 1, 0) {
		tmp = num(n[i]);
		ans += tmp*B;
		B *= b;
		if(ans > 65)
			return -1;
	}
	return ans;
}

bool inline valid(int h, int m) {
	return (h >= 0 && h <= 23 && m >= 0 && m <= 59) ? true : false;
}

int main()
{
	char at[1000], bt[1000];
	Sf("%[^:]%*c%s", at, bt);

	ST hh(at), mn(bt);

	trim(hh);	trim(mn);
	int mx = 0;
	for(auto x : hh)
		mx = max(mx, num(x));
	for(auto x : mn)
		mx = max(mx, num(x));

	vi ans;

	forab(i, mx + 1, 65) {
		int h = num(hh, i);
		int m = num(mn, i);

//		Pf("B = %d, h = %d, m = %d\n", i, h, m);

		if(valid(h, m))
			ans.pb(i);
	}

	if(ans.size() == 0)
		writeln(0);
	else if(*ans.rbegin() > 62)
		writeln(-1);
	else
		for(auto x: ans)
			write(x);
	cout << endl;


	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	ST name, n1, n2, tmp;
	int n;
	map<ST, int>m;

	cin >> name >> n;

	forn(_n, n) {
		cin >> n1 >> tmp;
		if(tmp[0] == 'l') {
			cin >> n2 >> tmp;
			n2 = n2.substr(0, n2.length()-2);
			if(n1 == name || n2 == name)
				m[n1] += 5, m[n2] += 5;
			else
				m[n1] = m[n1], m[n2] = m[n2];
		}
		else if(tmp[0] == 'c') {
			cin >> tmp >> n2 >> tmp;
			n2 = n2.substr(0, n2.length()-2);
			if(n2 == name || n1 == name)
				m[n1] += 10, m[n2] += 10;
			else
				m[n1] = m[n1], m[n2] = m[n2];
		}
		else
		{
			cin >> tmp >> n2 >> tmp;
			n2 = n2.substr(0, n2.length()-2);
			if(n1 == name || n2 == name)
				m[n1] += 15, m[n2] += 15;
			else
				m[n1] = m[n1], m[n2] = m[n2];
		}
	}
/*
	tr(it, m)	
		cout << it->first << " " << it->second << endl;

*/
	map <int, vector<ST>,  greater<int>  > mm;

	tr(it, m)
	{
		int n = it->second;
		ST t = it->first;
		if(present(n, mm)) 
			mm[n].pb(t);
		else
		{
			mm[n] = vector<ST> ();
			mm[n].pb(t);
		}

	}

	tr(it, mm)
	{
//		cout << it->first << " ";
		vector <ST> vvs = it->second;
		sort(all(vvs));
		tr(jt, vvs) 	if(*jt != name)
			cout << *jt << endl;
	}


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)



int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a%b);
}

int Find(int lo, int hi, int d) {
	rep(i, hi, lo)
		if(d % i == 0)	
			return i;
	return -1;
}
vi fact;
vi res;
vector <bool> vis;
int sz;

void bt(int idx = 0)
{
	if(idx == sz)
	{
		int t = 1;
		forn(i, sz)	if(vis[i])
			t *= fact[i];
		res.pb(t);
		return;
	}
	vis[idx] = false;
	bt(idx+1);
	vis[idx] = true;
	bt(idx+1);
}

void Process(int n) {
	fact.clear();

	while(n % 2 == 0)
		fact.pb(2), n /= 2;

	for(int i = 3; i*i <= n; i+=2)
	{
		while(n%i == 0)
		{
//			cout << n << " " << i << endl;
			fact.pb(i);
			n /= i;
		}
	}
	if(n != 1)
		fact.pb(n);

//	cout << endl << endl;
//
	sz = SZ(fact);
	vis.resize(sz);
	res.clear();

	bt( 0);

	sort(all(res));

	res.resize(unique(all(res))- res.begin() );
/*
	tr(it, res)
		cout << *it << " \t";
	cout << endl;
	*/
}

int FindNew(int lo, int hi) {

	vector <int> :: iterator it;
	it = upper_bound(all(res), hi);
	int idx = it - res.begin();

	if(it != res.end() && *it <= hi && *it >=lo)
		return *it;
	
	if(it != res.begin()){
		int n = res[idx-1];
		if(n >= lo && n <= hi)
			return n;
	}
	return -1;

}

int main()
{
	int a, b, low, hi;
	cin >> a >> b;
	int n, d = gcd(a, b);

	Process(d);
/*
	tr(it, fact)
		cout << *it << " ";
	cout << endl << endl;;
*/
	cin >> n;

	forn(_n, n) {
		Sf("%d %d", &low, &hi);
		Pf("%d\n", FindNew(low, hi));
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int Remove(int a) {
	SS ss;
	ss << a;
	ST st, n = "";
	ss >> st;

	forn(i, st.length())	if(st[i] != '0')
		n += st[i];
	if(st.length() == 0)	n = "0";

	return atoi( n.c_str() );

}

int main()
{
	int a, b, sum;
	cin >> a >> b;
	sum = a +b;

	int aa = Remove(a), bb = Remove(b), ss = Remove(sum);

	if(aa + bb == ss)
		cout << "YES\n";
	else
		cout << "NO\n";

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

void fail() {
	cout << "NO";
	exit(0);
}

bool isMale(const ST & a) {
//	ST t = a.substr(a.length() - 2);
//	if(t == "os" || t == "er" || t == "is")
	if(a == "os" || a == "tr" || a == "is")
		return true;

	if(a == "la" || a == "ra" || a == "es")
		return false;

//	fail();
	assert(false);

	return  false;
}

enum parts {adj, noun, verb};

parts Type(const ST & a) {
	if(a == "os" || a == "la")
		return adj;
	if(a == "tr" || a == "ra")
		return noun;
	if(a == "is" || a == "es")
		return verb;
//	fail();
	assert(false);
	return adj;
}


bool valid(const ST &st) {
	int len = st.length();

	if(len > 3 && st.substr(len - 4) == "lios")
		return true;
	if(len >4 && st.substr(len - 5) == "liala")
		return true;
	if(len > 2 && st.substr(len - 3 ) == "etr")
		return true;
	if(len > 3 && st.substr(len - 4) == "etra")
		return true;
	if(len > 5 && st.substr(len - 6) == "initis")
		return true;
	if(len > 5 && st.substr(len - 6) == "inites")
		return true;
	return false;
}

int main()
{
	ST st;
	bool gender; 
	int cnt= 0;
	parts lst, cur;
	bool f = true;
	int idx = 0;

	while(cin >> st) {
		if(!valid(st))
			fail();

		st = st.substr(st.length() - 2);

		cur = Type(st);
		
		if(cur == noun)
				cnt++;

		if(f) {
			gender = isMale(st);
			lst = cur;
			if(lst == verb)
				fail();

			f = false;
		}
		else {
			if(gender != isMale(st))
				fail();
			if( (lst == adj && cur == verb) || (lst == noun && cur == noun) || ( lst == verb && cur != verb) ) 
				fail();
		}
		lst = cur;
		idx++;
	}

	if(cnt != 1 && idx != 1) 
		fail();

	cout << "YES";

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int64 a, b, cnt = 0;
	cin >> a >> b;

	while(b != 1LL) {
		if(b % a == 0LL)
			b/=a, 	cnt++;
		else
			break;
	}
	if(b == 1LL)
		cout << "YES\n" << cnt - 1 << endl;
	else
		cout << "NO\n";

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n, k;
	map<ST, set<ST> >m;
	vs name;

	m.clear();
	name.clear();

	cin >> n >> k;
	ST st, st1, st2, idx;

	forn(i, n) {
		cin >> st;
		name.pb(st);
	}

	forn(i, n)
		forn(j, n)
			if(i != j)
				m[name[i]].insert(name[j]);

	tr(it, m) {
		cout << it-> first << " : ";
		tr(jt, it->second)
			cout << *jt << " ";
		cout << endl;
	}

	forn(i, k) {
		cin >> st1 >> st2;
		m[st1].erase(st2);
		m[st2].erase(st1);

	}
	tr(it, m) {
		cout << it-> first << " : ";
		tr(jt, it->second)
			cout << *jt << " ";
		cout << endl;
	}

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int sc[26], tc[26];

int process(int cnt) {
	int diff = 0;
	forn(i, 26) {
		if(sc[i] > tc[i])
			return 0;
		diff += (tc[i] - sc[i]);
	}
	return (diff == cnt ? 1 : 0) ; 
}

int main()
{
	ST s, t;	
	cin >> s >> t;
	if(t.size() > s.size()) {
		cout << 0 << endl;
		return 0;
	}

	int ans, diff = 0;
	forn(i, t.size()) {
		if(s[i] != '?')
			sc[s[i] - 'a']++;
		else
			diff++;
		tc[t[i] - 'a']++;
	}
	ans = process(diff);

	int b = 0, e = t.size() -1;

	while((++e) < s.size()) {
		if(s[e] != '?')
			sc[s[e] - 'a']++;
		else
			diff++;

		if(s[b] != '?')
			sc[s[b] - 'a']--;
		else
			diff --;
		b++;
		ans += process(diff);
	}
	cout << ans << endl;
	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n;
	cin >> n;
	vi a(n);
	forn(i, n)
		cin >> a[i];

	if(n == 1) {
		cout << 0 << endl;
		return 0;
	}

	int mn = 0, mx = 0;
	reverse(all(a));

	forn(i, n) {
		if(a[i] < a[mn])
			mn = i;
		if(a[i] >= a[mx])
			mx = i;
	}
//	cout << "mn = " << mn << " \t mx = " << mx << endl;
	if(mn < mx)
		cout << mn + (n-1-mx) << endl;
	else
		cout << mn + (n-1-mx) -1 << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

vector <vector <ii> > G;
vi dist;
int n, m, s, l;
struct Node {
	int v, curdist, pardist;
	Node() {
		v = curdist = pardist = -1;
	}
	Node(int n, int c, int p) {
		v = n;	curdist = c;
		pardist = p;
	}
};

bool operator < (const Node &a, const Node & b) {
	return a.curdist < b.curdist;
}

int main()
{
	cin >> n >> m >> s;
	s--;
	G.resize(n);
	dist = vi(n, 123456789);
	int x, y, w;
	forn(_m, m) {
		Sf("%d %d %d", &x, &y, &w);
		x--;	y--;
		G[x].pb(mp(y, w));
		G[y].pb(mp(x, w));
	}

	cin >> l;
	if(l == 0) {
		cout << 1 << endl;
		return 0;
	}

	int ans = 0;
	dist[s] = 0;
	priority_queue <Node> pq;
	pq.push(Node(s, 0, 0));

	while(!pq.empty()) {
		Node nd = pq.top();
		pq.pop();
		if(nd.curdist > l && nd.pardist < l) {
			ans++;
			continue;
		}
		if(nd.curdist > l)	continue;
		if(nd.curdist > dist[nd.v])	continue;

		tr(it, G[nd.v]) {
			if(it->second + nd.curdist < dist[it->first]) {
				dist[it->first] = nd.curdist + it->second;
				pq.push(Node(it->first, dist[it->first], nd.curdist));
			}
		}
	}

	tr(it, dist)
		if(*it == l)
			ans++;

	forn(i, dist.size()) {
//		cout << i+1 << "-" << dist[i] << endl;
	}
	cout << ans << endl;

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	vector <ii> idx;
	int x11, y11, x22, y22, x1, x2, y1, y2;
	cin >> x11 >> y11 >> x22 >> y22;
	x1 = min(x11, x22),	x2 = max(x11, x22);
	y1 = min(y11, y22),	y2 = max(y11, y22);

	forab(x, x1, x2) {
		idx.pb(mp(x, y1));
		idx.pb(mp(x, y2));
	}
	forab(y, y1, y2) {
		idx.pb(mp(x1, y));
		idx.pb(mp(x2, y));
	}
	sort(all(idx));
	idx.resize(unique(all(idx)) - idx.begin());
	vi in(idx.size(), 1);
/*
	tr(it, idx) {
		Pf("(%d, %d) ", it->first, it->second);
	}
*/
	int test, x, y, r, xx, yy;
	cin >> test;
	while(test--) {
		Sf("%d %d %d", &x, &y, &r);

		forn(i, idx.size()) {
			xx = x - idx[i].first;
			yy = y - idx[i].second;
			if(xx*xx + yy*yy <= r*r)
				in[i] = 0;
		}

	}

	cout << accumulate(all(in), 0) << endl;
	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define Max 100500
bool pr[Max];
/*
void PreProcess()
{
	CL(pr, );
}
*/
int main()
{
	int n;
	cin >> n;
	int a[n];

	forn(i, n)
		Sf("%d", &a[i]);
/*
	forn(i, n)
		cout << a[i] << endl;
*/
	bool found = false;

/*
	forn(i,n)
		Pf("a[%d] = %d , ", i, a[i]);
	cout << endl << endl;

*/
	rep(i, n, 1)	if(n % i == 0 && n/i >= 3)
	{
//		cout << "Size  : "  << i << endl << endl;

		forn(j, i)
		{

//			cout << "Starts at : "  << j << " -> ";

			bool f = true;
			for(int k = j; k < n; k+= i)
			{

//				Pf("a[%d] = %d , ", k, a[k]);

				if(a[k] == 0)
				{
					f = false;
					break;
				}
			}

			if(f)
			{
				found = true;

//				Pf("Polygon starts at : %d and size is : %d\n", j, i);

				cout << "YES"<< endl;
				return 0;
			}

//			cout << "\n\n";
		}
	}

	cout << "NO\n";

	return 0;
}
m[1] = "H"; 	m[2] = "He"; 	m[3] = "Li"; 	m[4] = "Be"; 	m[5] = "B"; 	m[6] = "C"; 	m[7] = "N"; 	m[8] = "O"; 	m[9] = "F"; 	m[10] = "Ne"; 	m[11] = "Na"; 	m[12] = "Mg"; 	m[13] = "Al"; 	m[14] = "Si"; 	m[15] = "P"; 	m[16] = "S"; 	m[17] = "Cl"; 	m[18] = "Ar"; 	m[19] = "K"; 	m[20] = "Ca"; 	m[21] = "Sc"; 	m[22] = "Ti"; 	m[23] = "V"; 	m[24] = "Cr"; 	m[25] = "Mn"; 	m[26] = "Fe"; 	m[27] = "Co"; 	m[28] = "Ni"; 	m[29] = "Cu"; 	m[30] = "Zn"; 	m[31] = "Ga"; 	m[32] = "Ge"; 	m[33] = "As"; 	m[34] = "Se"; 	m[35] = "Br"; 	m[36] = "Kr"; 	m[37] = "Rb"; 	m[38] = "Sr"; 	m[39] = "Y"; 	m[40] = "Zr"; 	m[41] = "Nb"; 	m[42] = "Mo"; 	m[43] = "Tc"; 	m[44] = "Ru"; 	m[45] = "Rh"; 	m[46] = "Pd"; 	m[47] = "Ag"; 	m[48] = "Cd"; 	m[49] = "In"; 	m[50] = "Sn"; 	m[51] = "Sb"; 	m[52] = "Te"; 	m[53] = "I"; 	m[54] = "Xe"; 	m[55] = "Cs"; 	m[56] = "Ba"; 	m[57] = "La"; 	m[58] = "Ce"; 	m[59] = "Pr"; 	m[60] = "Nd"; 	m[61] = "Pm"; 	m[62] = "Sm"; 	m[63] = "Eu"; 	m[64] = "Gd"; 	m[65] = "Tb"; 	m[66] = "Dy"; 	m[67] = "Ho"; 	m[68] = "Er"; 	m[69] = "Tm"; 	m[70] = "Yb"; 	m[71] = "Lu"; 	m[72] = "Hf"; 	m[73] = "Ta"; 	m[74] = "W"; 	m[75] = "Re"; 	m[76] = "Os"; 	m[77] = "Ir"; 	m[78] = "Pt"; 	m[79] = "Au"; 	m[80] = "Hg"; 	m[81] = "Tl"; 	m[82] = "Pb"; 	m[83] = "Bi"; 	m[84] = "Po"; 	m[85] = "At"; 	m[86] = "Rn"; 	m[87] = "Fr"; 	m[88] = "Ra"; 	m[89] = "Ac"; 	m[90] = "Th"; 	m[91] = "Pa"; 	m[92] = "U"; 	m[93] = "Np"; 	m[94] = "Pu"; 	m[95] = "Am"; 	m[96] = "Cm"; 	m[97] = "Bk"; 	m[98] = "Cf"; 	m[99] = "Es"; 	m[100] = "Fm"; 	m[101] = "Md"; 	m[102] = "No"; 	m[103] = "Lr"; 	m[104] = "Rf"; 	m[105] = "Db"; 	m[106] = "Sg"; 	m[107] = "Bh"; 	m[108] = "Hs"; 	m[109] = "Mt"; 	m[110] = "Ds"; 	m[111] = "Rg"; 	m[112] = "Cn"; 	m[113] = "Uut"; 	m[114] = "Uuq"; 	m[115] = "Uup"; 	m[116] = "Uuh"; 	m[117] = "Uus"; 	m[118] = "Uuo"; 	//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n;
	cin >> n;
	ST st;

	forn(_n, n)
	{
		cin >> st;

		if(st.length() <= 10)
			cout << st << endl;
		else
		{
			int len = st.length() ;

			SS ss;
			ss << st[0] << len-2 << st[len-1];
			cout << ss.str() << endl;
		}
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

bool is[110];
bool used[110];

bool find(int curSum, int sum)


int main()
{
	map<int, string>m;
	map<string, int>mm;
	
	m[1] = "H"; 	m[2] = "He"; 	m[3] = "Li"; 	m[4] = "Be"; 	m[5] = "B"; 	m[6] = "C"; 	m[7] = "N"; 	m[8] = "O"; 	m[9] = "F"; 	m[10] = "Ne"; 	m[11] = "Na"; 	m[12] = "Mg"; 	m[13] = "Al"; 	m[14] = "Si"; 	m[15] = "P"; 	m[16] = "S"; 	m[17] = "Cl"; 	m[18] = "Ar"; 	m[19] = "K"; 	m[20] = "Ca"; 	m[21] = "Sc"; 	m[22] = "Ti"; 	m[23] = "V"; 	m[24] = "Cr"; 	m[25] = "Mn"; 	m[26] = "Fe"; 	m[27] = "Co"; 	m[28] = "Ni"; 	m[29] = "Cu"; 	m[30] = "Zn"; 	m[31] = "Ga"; 	m[32] = "Ge"; 	m[33] = "As"; 	m[34] = "Se"; 	m[35] = "Br"; 	m[36] = "Kr"; 	m[37] = "Rb"; 	m[38] = "Sr"; 	m[39] = "Y"; 	m[40] = "Zr"; 	m[41] = "Nb"; 	m[42] = "Mo"; 	m[43] = "Tc"; 	m[44] = "Ru"; 	m[45] = "Rh"; 	m[46] = "Pd"; 	m[47] = "Ag"; 	m[48] = "Cd"; 	m[49] = "In"; 	m[50] = "Sn"; 	m[51] = "Sb"; 	m[52] = "Te"; 	m[53] = "I"; 	m[54] = "Xe"; 	m[55] = "Cs"; 	m[56] = "Ba"; 	m[57] = "La"; 	m[58] = "Ce"; 	m[59] = "Pr"; 	m[60] = "Nd"; 	m[61] = "Pm"; 	m[62] = "Sm"; 	m[63] = "Eu"; 	m[64] = "Gd"; 	m[65] = "Tb"; 	m[66] = "Dy"; 	m[67] = "Ho"; 	m[68] = "Er"; 	m[69] = "Tm"; 	m[70] = "Yb"; 	m[71] = "Lu"; 	m[72] = "Hf"; 	m[73] = "Ta"; 	m[74] = "W"; 	m[75] = "Re"; 	m[76] = "Os"; 	m[77] = "Ir"; 	m[78] = "Pt"; 	m[79] = "Au"; 	m[80] = "Hg"; 	m[81] = "Tl"; 	m[82] = "Pb"; 	m[83] = "Bi"; 	m[84] = "Po"; 	m[85] = "At"; 	m[86] = "Rn"; 	m[87] = "Fr"; 	m[88] = "Ra"; 	m[89] = "Ac"; 	m[90] = "Th"; 	m[91] = "Pa"; 	m[92] = "U"; 	m[93] = "Np"; 	m[94] = "Pu"; 	m[95] = "Am"; 	m[96] = "Cm"; 	m[97] = "Bk"; 	m[98] = "Cf"; 	m[99] = "Es"; 	m[100] = "Fm"; 	m[101] = "Md"; 	m[102] = "No"; 	m[103] = "Lr"; 	m[104] = "Rf"; 	m[105] = "Db"; 	m[106] = "Sg"; 	m[107] = "Bh"; 	m[108] = "Hs"; 	m[109] = "Mt"; 	m[110] = "Ds"; 	m[111] = "Rg"; 	m[112] = "Cn"; 	m[113] = "Uut"; 	m[114] = "Uuq"; 	m[115] = "Uup"; 	m[116] = "Uuh"; 	m[117] = "Uus"; 	m[118] = "Uuo"; 	
	mm["H"] = 1; 	mm["He"] = 2; 	mm["Li"] = 3; 	mm["Be"] = 4; 	mm["B"] = 5; 	mm["C"] = 6; 	mm["N"] = 7; 	mm["O"] = 8; 	mm["F"] = 9; 	mm["Ne"] = 10; 	mm["Na"] = 11; 	mm["Mg"] = 12; 	mm["Al"] = 13; 	mm["Si"] = 14; 	mm["P"] = 15; 	mm["S"] = 16; 	mm["Cl"] = 17; 	mm["Ar"] = 18; 	mm["K"] = 19; 	mm["Ca"] = 20; 	mm["Sc"] = 21; 	mm["Ti"] = 22; 	mm["V"] = 23; 	mm["Cr"] = 24; 	mm["Mn"] = 25; 	mm["Fe"] = 26; 	mm["Co"] = 27; 	mm["Ni"] = 28; 	mm["Cu"] = 29; 	mm["Zn"] = 30; 	mm["Ga"] = 31; 	mm["Ge"] = 32; 	mm["As"] = 33; 	mm["Se"] = 34; 	mm["Br"] = 35; 	mm["Kr"] = 36; 	mm["Rb"] = 37; 	mm["Sr"] = 38; 	mm["Y"] = 39; 	mm["Zr"] = 40; 	mm["Nb"] = 41; 	mm["Mo"] = 42; 	mm["Tc"] = 43; 	mm["Ru"] = 44; 	mm["Rh"] = 45; 	mm["Pd"] = 46; 	mm["Ag"] = 47; 	mm["Cd"] = 48; 	mm["In"] = 49; 	mm["Sn"] = 50; 	mm["Sb"] = 51; 	mm["Te"] = 52; 	mm["I"] = 53; 	mm["Xe"] = 54; 	mm["Cs"] = 55; 	mm["Ba"] = 56; 	mm["La"] = 57; 	mm["Ce"] = 58; 	mm["Pr"] = 59; 	mm["Nd"] = 60; 	mm["Pm"] = 61; 	mm["Sm"] = 62; 	mm["Eu"] = 63; 	mm["Gd"] = 64; 	mm["Tb"] = 65; 	mm["Dy"] = 66; 	mm["Ho"] = 67; 	mm["Er"] = 68; 	mm["Tm"] = 69; 	mm["Yb"] = 70; 	mm["Lu"] = 71; 	mm["Hf"] = 72; 	mm["Ta"] = 73; 	mm["W"] = 74; 	mm["Re"] = 75; 	mm["Os"] = 76; 	mm["Ir"] = 77; 	mm["Pt"] = 78; 	mm["Au"] = 79; 	mm["Hg"] = 80; 	mm["Tl"] = 81; 	mm["Pb"] = 82; 	mm["Bi"] = 83; 	mm["Po"] = 84; 	mm["At"] = 85; 	mm["Rn"] = 86; 	mm["Fr"] = 87; 	mm["Ra"] = 88; 	mm["Ac"] = 89; 	mm["Th"] = 90; 	mm["Pa"] = 91; 	mm["U"] = 92; 	mm["Np"] = 93; 	mm["Pu"] = 94; 	mm["Am"] = 95; 	mm["Cm"] = 96; 	mm["Bk"] = 97; 	mm["Cf"] = 98; 	mm["Es"] = 99; 	mm["Fm"] = 100; 	mm["Md"] = 101; 	mm["No"] = 102; 	mm["Lr"] = 103; 	mm["Rf"] = 104; 	mm["Db"] = 105; 	mm["Sg"] = 106; 	mm["Bh"] = 107; 	mm["Hs"] = 108; 	mm["Mt"] = 109; 	mm["Ds"] = 110; 	mm["Rg"] = 111; 	mm["Cn"] = 112; 	mm["Uut"] = 113; 	mm["Uuq"] = 114; 	mm["Uup"] = 115; 	mm["Uuh"] = 116; 	mm["Uus"] = 117; 	mm["Uuo"] = 118; 	

	bool is[110];

	CL(is, 0);

	int n, k;
	cin >> n >> k;

	ST st;
	map<int, string> :: iterator it;

	forn(i, n)
	{
		cin >> st;
		
		it = m.find(st);
		is[it->first] = 1;

	}
	
	forn(_k, k)
	{
		cin >> st;
		CL(used, 0);
		
		if(!Find(0, mm[st]))
			cout << "NO\n";
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	ST st, tmp;
	char ch;
	int n;

	while(cin >> n >> ch >> st >> ch >> tmp )
		cout << "mm[\"" << st << "\"] = " << n << "; \t"; 
//		cout << "m[" << n << "] = \"" << st << "\"; \t";
//		cout << n << ' ' << st << endl;


	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef string ST;
typedef stringstream SS;
typedef vector< vector<int> > vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;

#define Pf	printf
#define	Sf	scanf

#define PI M_PI
#define E M_E
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int n, k, t, sum = 0;

	cin >> n >> k >> t;
//	cout << n << " " <<  k << " " << t << endl;
/*
	forn(_n, n)
	{
		if(sum < t)
		{
			if(sum + k > t)
			{
				sum = t;
				cout << t-sum << " ";
			}
			else
			{
				sum += k;
				cout << k << " ";
			}
		}
		else
			cout << 0 << " ";
	}
*/

	t = n*k*t/100;

	forn(_n, n)
	{
		if(sum < t)
		{
			if(sum + k < t)
			{
				sum += k;
				cout << k << " ";
			}
			else
			{
				cout << t - sum << " ";
				sum = t;
			}
		}
		else
			cout << 0 << " ";
	}
	return 0;
}
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST a[9];

	forn(i, 8)
		cin >> a[i];
//	forn(i, 8)
//		cout << a[i] << endl;
	
	bool flag = false;

	forn(i, 8)
		if(a[i][0] == 'S')
			flag = true;
	
	if(!flag) {
		cout << "WIN";
		return 0;
	}

	if(a[0][0] != 'S')
		cout << "LOSE";

	else if(a[6][1] == 'S' || a[4][2] == 'S' || a[2][3] == 'S' || a[0][4] == 'S')
		cout << "LOSE";
	else
		cout<< "WIN";

	return 0;
}

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n, sum = 0, even = 0, odd = 0;
	int tmp;
	cin >> n;

	forn(i, n) {
		cin >> tmp;
		if(tmp % 2 == 0)
			even++;
		else
			odd++;
		sum += tmp;
	}

	if(sum % 2 == 0)
		cout << even << endl;
	else
		cout << odd << endl;

	return 0;
}

#define mp		make_pair

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9
#define	Sf		scanf
#define	Pf		printf

#define pb		push_back
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;

#define	all(c)		(c).begin(), (c).end()
#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)
#define	CL(a, b)	memset(a, b, sizeof(a))

int main()
{
	int n, m, x, y;
	bool in[111];
	CL(in, -1);
	
	cin >> n >> m;
	vector <set <int> > v(n);

	forn(i, m) {
		Sf("%d %d", &x, &y);
		v[x-1].insert(y-1);
		v[y-1].insert(x-1);
	}

	int ans = 0;
	set<int> :: iterator jt;

	while(true) {
		vi a;
		a.clear();
		forn(i, n)	if(in[i] && v[i].size() == 1)
			a.pb(i);

		if(a.size() == 0)	break;
		ans++;

		tr(it, a) {
			int t = *it;
			in[t] = false;
			
			forn(i, n)	 if(in[i] && (jt = v[i].find(t)) != v[i].end() )
				v[i].erase(jt);

		}

	}

//	cout << n-total << endl;
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n;
	cin >> n;
	vi num(n*n);

	forn(i, n*n)
		cin >> num[i];

	int sum[10], sumd[10];
	int sumd0, sumd1;
	sort(all(num));

	do {
		CL(sum, 0);
		CL(sumd, 0);
		sumd0 = sumd1 = 0;

		forn(i,n) {
			forn(j, n)
				sum[i] += num[i*n + j], sumd[j] += num[i*n + j];
			sumd0 += num[n*i + i];
			sumd1 += num[n*i + n-1-i];
		}

			
		bool flag = true;
		forn(i, n) {
//			cout << sum[0] << " " << sum [i] << " " << sumd[i] << endl;
			if(sum[0] != sum[i] || sum[0] != sumd[i]) {
				flag = false;
				break;
			}
		}
//		cout << flag << endl;
		flag &= (sum[0] == sumd0 && sum[0] == sumd1) ? true : false;
/*
		forn(i, n)
			cout << sum[i] << " " << sumd[i] << endl;
		cout << sumd0 << " " << sumd1 << endl; 
*/
		if(flag) {
			cout << sum[0] << endl;
			forn(i, n) {
				forn(j, n)
					cout << num[i*n + j] << " ";
				cout << endl;
			}
			return 0;
		}
		
	} while(next_permutation(all(num)));
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int64 arr[(int)1e6];
int64 n;

int main()
{
	vector<int64> pow;

	for(int i = 0; (1ll<<i) < 1e6 ; i++)
		pow.pb(1ll<<i);


	cin >> n;
	forab(i, 1, n)
		cin >> arr[i];

	int64 sum = 0;
	for(int64 i = 1; i < n; i++) {
//	forab(i, 1, n-1) {
		sum += arr[i];
		cout << sum << "\n";

		for(int64 j = pow.size()-1; j >= 0; j--) {
//		rep(j, pow.size() - 1, 0) {
			if(i + pow[j] <= n) {
				arr[i+pow[j]] += arr[i];
				break;
			}
		}

	}
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

set <int> used;
map <int, int> hsh;

int main()
{
	int h, m, n, id, t, ret = 0;
	char sgn;

	Sf("%d %d %d\n", &h, &m, &n);

	while(n--) {
		Sf("%c %d", &sgn, &id);
		int i = 0;

		if(sgn == '+') {
			Sf(" %d", &t);

			while(used.find( (t + i*m)%h ) != used.end())
				i++, ret++;
			used.insert( (t + i*m)%h );
			hsh[id] = (t + i*m ) % h;
		}
		else {
			used.erase(hsh[id]);
		}
		Sf("\n");
	}

	cout << ret << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 2e5 + 10;
int H[sz];
int  h, m, n;
map <int, int> hsh;

map <int, set <int> > used;

int main()
{
//	cin >> h >> m >> n;
	Sf("%d %d %d\n", &h, &m, &n);
	int ret = 0;

//	cout << h << " " << m << " " << n << endl << endl;

	while(n--) {
		char sign;
		int id;
		Sf("%c %d", &sign, &id);

		if(sign == '+') {
			int t, cnt = 0;
			Sf("%d", &t);
/*
			if(used.find(t%m) == used.end()) {
				used[t%m] = set <int> {t};
				hsh[id] = t%m;
			}
*///			else 
			{
				auto &st = used[t%m];
				while( st.find( (t + cnt*m) % h) != st.end())
					ret++, cnt++;
				st.insert((t + cnt*m ) % h);
				hsh [id] = (t + cnt*m )% h;
			}
//			Pf("sign = %c, id = %d, t = %d\n", sign, id, hsh[id]);
		}
		else {
			int hs = hsh[id];
//			Pf("sign = %c, id = %d, t = %d\n", sign, id, hs);
			used[hs%m].erase(hs);
		}
//		cout << "cnt = " << ret << endl;
		Sf("\n");
/*
		for(auto &x: used) {
			cout << x.first << " -> ";
			for(auto &y: x.second)
				cout << y << " ";
			cout << endl;
		}
		cout << endl;
*/	}
	cout << ret << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e5 + 10;
int a[sz], b[sz];

int main()
{
	int n, m, c;
	cin >> n >> m >> c;

	forn(i, n)
		read(a[i]);
	forn(i, m)
		read(b[i]);

	int sum = 0, k = 0;

	forn(i, n) {
		if(i < m)
			sum = (sum + b[i]) % c;
		if(i > n-m)
			sum = (sum- b[k++] + c) % c;

		write((a[i] + sum)%c);
	}
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e4 + 10;
int64 a[sz], b[sz], c, n;

int64 check(int64 x) {
	int64 cnt = 0;

	forn(i, n) {
		cnt += 1 + (a[i]*x)/b[i];
	}

	return cnt ;
}

int main()
{
	cin >> n >> c;

	forn(i, n) 
		cin >> a[i] >> b[i];

	int64 l = -1, r = -1;
	int64 ret = 0ll;
/*
	forn(i, 1111) {
		if(check(i)) {
			if(l == -1)
				l = i;
			r = i;
			ret++;
		}
	}
*/
	int64 low = 0, high = (long long)3e15 + 10;

	while(low < high) {
		int64 mid = (low + high )/2;
//		Pf("(%lld, %lld) = %lld\n", low, high,mid);
		if(check(mid) >= c)
			high = mid;
		else
			low = mid+1;
	}
	//cout << low << endl;
	l = low;

	low = 0, high = (long long)3e15 + 10;
	while(low < high) {
		int64 mid = (low + 1 +  high )/2;
//		Pf("(%lld, %lld) = %lld\n", low, high,mid);
		if(check(mid) > c)
			high = mid-1;
		else
			low= mid;
	}
	//cout << low << endl;
	//
	cout << high - low + 1 << endl;

//	Pf("l = %lld, r = %lld, cnt = %lld", l, r, ret);
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int arr[111][111] = {0};

int main()
{
	int N;
	cin >> N;
	int sum = 0;

	forn(i, N) {
		forn(j, N)  {
			int tmp;
			cin >> tmp;
			if(i == j || i == N-j-1 || i == N/2 || j == N/2)
				sum += tmp;
		}
	}
	cout << sum << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 2e3 + 10;

vvi G, rG;
vector <ii> frnd, enmy;
int N, K, M;

int sset[sz] ;
bool vis[sz] = {0};
map <int, int> setsize;
bool enable[sz]; 
int grpCnt;

void dfs(int n) {
	if(vis[n])
		return;

	vis[n] = true;
	sset[n] = grpCnt;
	setsize[grpCnt]++;

	for(auto &x: G[n]) {
		if(!vis[x])
			dfs(x);
	}
}

int main()
{
	G.clear();	
	rG.clear();
	frnd.clear();
	enmy.clear();
	CL(sset, -1);
	CL(enable, -1);

	read(N);
	G.resize(N+1);

	read(K);
	forn(_k, K) {
		int a, b;
		Sf("%d %d", &a, &b);
		G[a].pb(b);
		G[b].pb(a);
		frnd.pb(mp(a, b));
	}
	
	read(M);
	forn(_m, M) {
		int a, b;
		Sf("%d %d", &a, &b);
		enmy.pb(mp(a, b));
	}


	CL(vis, 0);
	forab(i,1, N) 	if(!vis[i]) {
		grpCnt++;
		dfs(i);
	}
/*
	cout << grpCnt << endl;
	cout << endl;

	forab(i, 1, N)
		cout << i << " " << sset[i] << endl;
	cout << endl;
*/

	for(auto &x: enmy) {
		if(sset[x.first] == sset[x.second])
			enable[sset[x.first]] = false;
	}

	int ret = 0;
	for(auto &x: setsize) {
		if(enable[x.first])
			ret = max(ret, x.second);
	}

	cout << ret << endl;

	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e4;
int Ans[sz] = {};

int f(int n) {
	int &ret = Ans[n];
	if(ret > -1)
		return ret;

	ret = -1;

	rep(i, n/2, 2)	if(n % i == 0) {
		return n + f(i);
//		int tmp = f( i);
//		cout << n << " -> " << i << " = " << tmp << endl;
//		ret = max(ret, tmp);
	}
//	cout << endl;

//	if(ret == -1)
//		cout << n << " -> " << 1 << " = " << n + 1 << endl << endl;

	ret = (ret == -1 ? n+1 : ret + n);
	return ret;
}

int main()
{
	CL(Ans, -1);
	Ans[1] = 1;

	int n;
	forab(a, 1, 1000) {
		cout << f(a) << endl;
	}
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e5 + 10;
bool isPrime[sz];
vi prime;

void preprocess() {
	prime.clear();
	
	CL(isPrime, -1);

	isPrime[0] = isPrime[1] = false;

	for(int i = 2; i*i <= sz; i++)	if(isPrime[i]) {
		for(int j = i+i; j < sz; j+=i)
			isPrime[j] = false;
	}

	forn(i, sz)
		if(isPrime[i])
			prime.pb(i);
/*
	for(auto &x: prime) {
		cout << x << " ";
	}
	cout << endl;
*/
}

int f(int n) {
	if(n == 1)
		return 1;
	if(n < sz && isPrime[n])
		return n+1;

	for(auto &x: prime) {
		if(x*x > n)
			return n+1;
		if(n % x == 0)
			return n+f(n/x);
	}

	return n +1;

}

int main()
{
	preprocess();

	int n;
	cin >> n;
	cout << f(n) << endl;
	
	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	ST st;
	cin >> st;
	int cnt[30] = {0};
	char pair[30] = {'\0'};
	bool in[30] = {false};
	forn(i, 30)
		in[i] = true;


	forn(i, st.size())
		cnt[st[i] - 'a']++;
/*
	forn(i, 26)
		cout << (char)(i + 'a') << " : " << cnt[i] << endl;
*/
	int n;
	cin >> n;
	while(n--) {
		char ch1, ch2;
		cin >> ch1 >> ch2;
		pair[ch1 - 'a'] = ch2;
		pair[ch2 - 'a'] = ch1;
	}

	int ans = 0;


	forn(i, st.size())	 if(in[st[i] - 'a']) {
		int j = i + 1;
		for(; j < st.size() && !in[st[j] - 'a']; j++);

		if(j == st.size())
			continue;

		if(pair[st[i] - 'a'] != st[j])
			continue;

		if(cnt[st[i] - 'a'] > cnt[st[j] - 'a']) {
			in[st[j] - 'a'] = false;
			ans++;
		}
		else {
			in[st[i] - 'a'] = false;
			ans++;
		}
	}
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	int n;
	cin >> n;
	int t, mx, mn;
	cin >> t;
	mx = mn = t;

	int ans = 0;
	forn(i, n-1) {
		cin >> t;
		if(t > mx) {
			ans++;
			mx = t;
		}
		if(t < mn)     {
			ans++;
			mn = t;
		}
	}
	cout<< ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

const int sz = 1e5 + 100;

int main()
{
	bool open[sz] = {false}, in[sz] = {false};
	bool isPrime[sz];
	CL(isPrime, -1);

	isPrime[0] = isPrime[1] = false;
	vvi factor(sz);

	for(int i = 2; i < sz; i++)	if(isPrime[i]) {
		factor[i].pb(i);
		for(int j = i+i;j < sz; j+= i) {
			factor[j].pb(i);
			isPrime[j] = false;
		}
	}

	int ass[sz];
	CL(ass, -1);

	int n, m;
	Sf("%d %d\n", &n, &m);
	int t;
	char ch;

//	cout << n << " " << m << endl;
	forn(_m, m) {
		Sf("%c %d\n", &ch, &t);
//		Pf("%c %d\n", ch, t);
//		continue;

		if(ch == '-') {
			if(open[t] == false) 
				Pf("Already off\n");
			else {
				tr(it, factor[t])
					ass[*it] = -1;
				open[t] = false;
				Pf("Success\n");
			}
		}
		else {
			if(open[t]) {
				Pf("Already on\n");
				continue;
			}
			bool flag = true;
			tr(it, factor[t]) {
				if(ass[*it] > -1) {
					Pf("Conflict with %d\n", ass[*it]);
					flag = false;
					break;
				}
			}
			if(flag) {
				open[t] = true;
				tr(it, factor[t])
					ass[*it] = t;
				Pf("Success\n");
			}
		}
	}

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	map <char, char> m;
	ST st;
	cin >> st;
	int i = 0, K;
	cin >> K;

	char pair[30] = {'\0'};

	while(K--) {
		char c1, c2;
		cin >> c1 >> c2;
		pair[c1 - 'a'] = c2;
		pair [c2 - 'a'] = c1;
	}

	int ans = 0;
	while( i < st.size()) {
		int j = i;

		for(;j < st.size() && (st[j] == st[i] || pair[st[i] - 'a'] == st[j]); j++);
		j--;

		int cnt1 = 0, cnt2 = 0;

		forab(k, i, j) {
			if(st[k] == st[i])
				cnt1++;
			else
				cnt2++;
		}
		ans += min(cnt1, cnt2);
		i = j+1;
	}
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

int main()
{
	forn(i, 100000/2)
		cout << "ab";
	cout << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defence Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>

using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
*/

#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

struct Node {
	int a, b;
	Node(int _a, int _b) {
		a = _a, b = _b;
	}
	Node() {
		a = b = -1;
	}
};

bool operator <(const Node & p, const Node &q) {
	if(p.b != q.b)
		return p.b > q.b;
	return p.a > q.a;
}

int main()
{
	int n;
	cin >> n;
	int t1, t2;
	vector <Node> v;
	forn(i, n) {
		cin >> t1 >> t2;
		v.pb(Node(t1, t2));
	}

	sort(all(v));

	int cnt = 1, ans = 0;

	for(int i = 0; i < v.size() && cnt > 0; cnt--, i++) {
		ans += v[i].a;
		cnt += v[i].b;
	}
	cout << ans << endl;

	return 0;
}

//Name         : Shinchan Nohara
//Age          : 5 years
//Organisation : Kasukabe Defense Force

#include <iostream>
#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
#include <fstream>
using namespace std;

typedef long long 		int64;
typedef vector<int> 		vi;
typedef string 			ST;
typedef stringstream 		SS;
typedef vector< vector<int> > 	vvi;
typedef pair<int,int> 		ii;
typedef vector<string> 		vs;
/*
#ifdef __cplusplus
	#undef __cplusplus
	#define __cplusplus 199712L
#endif
#if __cplusplus > 199711L	// for g++0x, value of __cplusplus must be greater thana 199711L.
	#define tr(i, c)	for(auto i = begin(c); i != end(c); i++)
#else
	#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#endif
*/

#define tr(i, c)	for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define PI		M_PI
#define E 		M_E
#define	ep		1e-9

#define	Sf		scanf
#define	Pf		printf

#define forn(i, n)	for(int i = 0, lets_stop_here = (int)n; i <  lets_stop_here; i++)
#define forab(i, a, b)	for(int i = a, lets_stop_here = (int)b; i <= lets_stop_here; i++)
#define rep(i, a, b)	for(int i = a, lets_stop_here = (int)b; i >= lets_stop_here; i--)

#define	all(c)		(c).begin(), (c).end()
#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp		make_pair

#define pb		push_back

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find( (c).begin(), (c).end(), x) != (c).end())	//vector & list//

#define read(n)		scanf("%d", &n)
#define write(n)	printf("%d ", n)
#define writeln(n)	printf("%d\n", n)

char G[55][55];
int N, M;
bool vis[55][55];

void show() {
	forn(i, N)	cout << G[i] << endl;	cout << endl;
}

bool valid(int i , int j) {
	return i >= 0 && i < N && j >= 0 && j < M;
}

int X[] = {0, 0, -1, 1};
int Y[] = {1, -1, 0, 0};

void dfs(int u, int v) {
	if(!valid(u, v))
		return ;

	if(G[u][v] == '.')
		return;

	if(vis[u][v] == true)
		return;

	vis[u][v] = true;

	forn(j, 4)
		dfs(u+X[j], v + Y[j]);
}

int main()
{
	cin >> N >> M;
	forn(i, N)
		cin >> G[i];

//	show();

	int cnt = 0;

	vector <ii> pts;
	forn(i, N)	forn(j, M)	if(G[i][j] == '#')	pts.pb(mp(i, j));

	forn(i, N)	forn(j, M)	cnt += G[i][j] == '#' ? 1 : 0;
	if(cnt <= 2) {
		cout << -1 << endl;
		return  0;
	}
	if(cnt == 3){
		cout << 1 << endl;
		return 0;
	}
	forn(i, N) {

		forn(j, M) { 	

			if(G[i][j] == '#'){
				CL(vis, 0);
				vis[i][j] = true;
				
				if(mp(i, j) == pts[0])
					dfs(pts[1].first, pts[1].second);
				else
					dfs(pts[0].first, pts[0].second);

				bool disConnected = false;

				forn(l, N)	forn(m, M)	if(G[l][m] == '#' && vis[l][m] == false)	disConnected = true;


				if(disConnected) {
					cout << 1 << endl;
					return 0;
				}
			}
		}
	}

	cout << 2 << endl;

	return 0;
}

//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define PI	3.141592653589793
#define E	2.718281828459045
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

int main()
{
	int bl, br, gl, gr;

	while(cin >> gl >> gr >> bl >> br)
	{
		if( (br >= (gl-1) && br <= 2*(gl+1) )|| (bl >= (gr-1) && bl <=2*(gr+1)))
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define PI	3.141592653589793
#define E	2.718281828459045
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define Max 100000
int main()
{
	int n = Max, k = 1;
	cout << n << ' ' << k << endl;

	int diff = 'z' - 'a';
	diff = 10;

	forn(_n, n)
		printf("%c", rand()%diff + 'a');
	printf("\n");

	forn(_k, k)
	{
		int nn = Max - rand()%5;
		forn(_nn, nn)
			Pf("%c", rand()%diff + 'a'+11);
		Pf("\n");
	}
	cout << flush;

	return 0;
}
//%%%%%%%%%%%%
//%%%%lost%%%%
//%%%%%%%%%%%%

#include <iostream>
#include <ctime>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cassert>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iterator>
using namespace std;

typedef long long  int64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef string ST;
typedef stringstream SS;

#define Pf	printf
#define	Sf	scanf

#define PI	3.141592653589793
#define E	2.718281828459045
#define	ep	1e-9

#define	CL(a, b)	memset(a, b, sizeof(a))
#define mp	make_pair

#define pb	push_back
#define	SZ(a)	int((a).size())

#define	all(c)	(c).begin(), (c).end()
#define tr(i, c)	for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)

#define	present(x, c)	((c).find(x) != (c).end())	//map & set//
#define	cpresent(x, c)	(find(all(c),x) != (c).end())	//vector & list//

#define forn(i, n)	for(int i = 0; i < n; i++)
#define forab(i, a, b)	for(int i = a; i <= b; i++)
#define rep(i, a, b)	for(int i = a; i>=b; i--)

#define Max 100001
int n, k;

int Find(char ch, int idx, char a[])
{
	int i = 0;

	if( a-idx > -1  && a[idx] == ch)
	{
		ans += ()
	}
}

int Process(char a, char b)
{
	int i = 0;

	while(b[i] != '\0')
	{

		i++;
	}
}

int main()
{
	char arr[Max], b[Max];
	int n, k;

	cin >> n >> k;

	Sf("%s", arr);

	forn(_n, n)
	{
		Sf("%s", b);
	}
	

	return 0;
}