import java.io.*;
import java.util.*;
import java.awt.geom.*;

/**
 * Solution to Top 25
 * 
 * @author vanb
 */
public class top25_vanb
{
    public Scanner sc;
    public PrintStream ps;
           
    /**
     * Driver.
     * @throws Exception
     */
    public void doit() throws Exception
    {
        sc = new Scanner( System.in );
        ps = System.out; 
        
        // Read in the first list
        int n = sc.nextInt();   
        String list1[] = new String[n];
        for( int i=0; i<n; i++ )
        {
            list1[i] = sc.next();  
        }
        
        // Read in the second list.
        // What's really important about list 2 is the indices.
        // We need a fast way to find them. We'll use a HashMap.
        HashMap<String,Integer> indices = new HashMap<String,Integer>();
        for( int i=0; i<n; i++ )
        {
            String team = sc.next();  
            indices.put( team, i );
        }
        
        // This is the index of the start of the current set
        int start = 0;
        
        // This is the maximum list 2 index of the current set
        int max = 0;
        for( int i=0; i<n; i++ )
        {
            // Again, this is the maximum list 2 index of the current set
            max = Math.max( max, indices.get( list1[i] ) );
            
            // Obviously, i is the maximum list 1 index of the current set.
            // If list 1's max and list 2's max are the same,
            // then they encompass the same range.
            if( max==i )
            {
                // Output the size of this set
                ps.println( i-start+1 );
                
                // Start a new set
                start=max=i+1;
            }
        }
    }
    
    /**
     * @param args
     */
    public static void main( String[] args ) throws Exception
    {
        new top25_vanb().doit();
    }   
}