include <stdio.h>
int ints_fill_BB(int n, int *a)
{
  int result = 0;
  int x=1;
  for (int i = 0; i < n; i++)
  {
    a[result++] = x;
    x++;
  }
  return result;
}

int ints_count_while_not( const int *a, int n, int x)
{
  int result = 0;
  while (result < n && a[result] != x)
    result++;
  return result;
}

int ints_runs_ep(const int *a, int n, int m, int *b, int *c)
{
int result =0;
int j=0;
for (int i =0; i <n; i++)
  	{
  		int z = ints_count_while_not(a+i, n-i,b[j]);

    if(a[i]!=b[j] && m>0)
     {
      c[result++]=z;
     }
    i+=z;
    j++;

  }
  return result;
}

int finalo(int *a, int n,int min, int *c)
{
	int result =0;
  if(min==0)
  {
   result=a[min];
  }
  else
  {
    for(int i=0;i<=min;i++)
    {
    result+=c[i];
    }
  }
	return result;
}

void ints_println_basic(const int *a, int n)
{
  if (n > 0)
  {
    printf("%d", a[0]);
    for (int i = 1; i < n; i++)
      printf(" %d", a[i]);
  }
  printf("\n");
}

void ints_println_special(const int *a, int n)
{
  if (n == 0)
    printf("*\n");
  else
    ints_println_basic(a, n);
}

int ints_get(int *a)
{
  int result = 0;
  int x;
  while (scanf("%d", &x) != EOF)
    a[result++] = x;
  return result;
}

int ints_argmin(const int *a, int n)
{
  int result = 0;
  int m = a[0];
  for (int i = 1; i < n; i++)
    if (m > a[i])
      m = a[result = i];
  return result;
}

void test_Big_Bang(void)
{
	int x;
	scanf("%d", &x);
	int a[x];
	int n= ints_fill_BB(x,a);
	ints_println_special(a,n);
	int b[1000];
	int c[1000];
	int m=ints_get(b);
	int q= ints_runs_ep(a,n,m,b,c);
	int k= ints_argmin(c,q);
	int x1= finalo(a,n,k,c);
 printf("%d\n", x1);
}

int main()
{
	test_Big_Bang();
}