#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<vector>

 #include<queue>

 using namespace std;

 #define fi first

 #define se second

 #define mp make_pair

 #define pb push_back

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<int,int> pii;

 namespace S

 {

 #define N 4000000

 int d[N],lc[N],rc[N];

 queue<int> q;

 void init()

 {

     for(int i=;i<N;i++)    q.push(i);

 }

 int getnode()

 {

     int t=q.front();q.pop();

     lc[t]=rc[t]=d[t]=;

     return t;

 }

 void delnode(int x){q.push(x);}

 void addx(int L,int x,int l,int r,int &num)

 {

     if(!num)    num=getnode();

     if(l==r)    {d[num]+=x;return;}

     int mid=l+((r-l)>>);

     if(L<=mid)    addx(L,x,l,mid,lc[num]);

     else    addx(L,x,mid+,r,rc[num]);

 }

 int merge(int x,int y)

 {

     if(!x||!y)    return x+y;

     lc[x]=merge(lc[x],lc[y]);

     rc[x]=merge(rc[x],rc[y]);

     d[x]+=d[y];

     delnode(y);

     return x;

 }

 void work(int L,int R,int l,int r,int &n1,int &n2)

 {

     if(!n1)    n1=getnode();

     if(L<=l&&r<=R)    {n1=merge(n1,n2);n2=;return;}

     int mid=l+((r-l)>>);

     if(L<=mid)    work(L,R,l,mid,lc[n1],lc[n2]);

     if(mid<R)    work(L,R,mid+,r,rc[n1],rc[n2]);

 }

 int ans[];

 void dfs(int l,int r,int k,int num)

 {

     if(l==r)

     {

         if(d[num])    ans[l]=k;

         return;

     }

     int mid=l+((r-l)>>);

     dfs(l,mid,k,lc[num]);dfs(mid+,r,k,rc[num]);

 }

 }

 int rt[];

 int n;

 int main()

 {

     int t,i,l,r,x,y,q;

     S::init();

     scanf("%d",&n);

     for(i=;i<=n;i++)

     {

         scanf("%d",&t);

         S::addx(i,,,n,rt[t]);

     }

     scanf("%d",&q);

     while(q--)

     {

         scanf("%d%d%d%d",&l,&r,&x,&y);

         if(x==y)    continue;

         S::work(l,r,,n,rt[y],rt[x]);

     }

     for(i=;i<=;i++)    S::dfs(,n,i,rt[i]);

     for(i=;i<=n;i++)    printf("%d ",S::ans[i]);

     return ;

 }