#include<iostream>
using namespace std;
struct node\创建链表
{
int val;
node *next;
node(int x):val(x),next(NULL){};
};
node *f(int a[],int n)
{
if(n0)
{
return NULL;
}
node *head=new node(a[0]);
node *cur=head;
for(int i=1;i<n;i++)
{
cur->next=new node(a[i]);
cur=cur->next;
}
return head;
}
void p(node *head)
{
node *cur=head;
while(cur!=NULL)
{
cout<<cur->val<<" ";
cur=cur->next;
}
}
node *ai(node *head, int a, int b)
{
node *d=new node(0);
d->next=head;
node *cur=d->next;
while(cur!=NULL)
{
if(cur->vala)
{
node *newnode=new node(b);
newnode->next=cur->next;
cur->next=newnode;
break;
}
cur=cur->next;
}
node *newhead=d->next;
delete d;
return newhead;
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
node *head=f(a,n);
int m,x;
cin>>m>>x;
head=ai(head,m,x);
p(head);
}
