Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to *a*<sub class="lower-index">1</sub> billion bourles, in 2002 — to *a*<sub class="lower-index">2</sub> billion, ..., and in the current (2000 + *n*)-th year — *a*<sub class="lower-index">*n*</sub> billion bourles. On the base of the information Petya decided to show in his presentation the linear progress history which is in his opinion perfect. According to a graph Petya has already made, in the first year BerSoft company income must amount to 1 billion bourles, in the second year — 2 billion bourles etc., each following year the income increases by 1 billion bourles. Unfortunately, the real numbers are different from the perfect ones. Among the numbers *a*<sub class="lower-index">*i*</sub> can even occur negative ones that are a sign of the company’s losses in some years. That is why Petya wants to ignore some data, in other words, cross some numbers *a*<sub class="lower-index">*i*</sub> from the sequence and leave only some subsequence that has perfect growth.

Thus Petya has to choose a sequence of years *y*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">2</sub>, ..., *y*<sub class="lower-index">*k*</sub>,so that in the year *y*<sub class="lower-index">1</sub> the company income amounted to 1 billion bourles, in the year *y*<sub class="lower-index">2</sub> — 2 billion bourles etc., in accordance with the perfect growth dynamics. Help him to choose the longest such sequence.
The first line contains an integer *n* (1 ≤ *n* ≤ 100). The next line contains *n* integers *a*<sub class="lower-index">*i*</sub> ( - 100 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 100). The number *a*<sub class="lower-index">*i*</sub> determines the income of BerSoft company in the (2000 + *i*)-th year. The numbers in the line are separated by spaces.
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char s1[1000010],s2[1000010];
int len1,len2;
int an;
int main()
{
	scanf("%s",s1+1);len1=strlen(s1+1);
	scanf("%s",s2+1);len2=strlen(s2+1);
	int t=1,bj=0,ans=0;
	for(int i=1;i<=len1;i++)
	{
		if(s1[i]==s2[t])
		{
			t++;
		}
		else
		{
			an=i;bj++;
		}
	}
	if(bj>1)
	{
		printf("0");
		return 0;
	}
	for(int i=an-1;i>=1;i--)
	{
		if(s1[i]==s1[an])
		{
			ans++;
		}
		else break;
	}
	printf("%d\n",ans+1);
	for(int i=an-ans;i<=an;i++) printf("%d ",i);
	return 0;
}