/*
 * Solution Template for Robot Writing
 * 
 * Australian Informatics Olympiad 2025
 * 
 * This file is provided to assist with reading of input and writing of output
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <stdio.h>

/* N is the number of tiles. */
int N;

/*
 * T contains the values on the tiles. Note that the array starts from 0, and
 * so the values are T[0] to T[N-1].
 */
int T[200005];

/* M is the length of target sequence. */
int M;

/*
 * S contains the target sequence. Note that the array starts from 0, and so
 * the values are S[0] to S[M-1].
 */
int S[200005];

int main(void) {
  int i;

  /* Read the values of N, S, M, and T. */

  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%d", &T[i]);
  }
  scanf("%d", &M);
  for (i = 0; i < M; i++) {
    scanf("%d", &S[i]);
  }

  /*
   * TODO: This is where you should compute your solution. You should output
   * YES or NO depending on whether it is possible for the robot to output the
   * target sequence. An example of how to output YES is shown below.
   */

  printf("YES\n");

  return 0;
}