678

package pkg678c.joty.and.chocolate;
import java.util.Scanner;
import java.lang.Math;
import java.util.Arrays;
public class JotyAndChocolate
{
    public static void main(String[] args)
    {
            long n,a,b,p,q;
            long beshi,kom;
            long dbeshi,dkom;
            long sieve[];
            long i,j,k;

            Scanner in=new Scanner(System.in);

            n=in.nextLong();
            a=in.nextLong();
            b=in.nextLong();
            p=in.nextLong();
            q=in.nextLong();

            dbeshi=Math.max(p, q);
            dkom=Math.min(p,q);

            if(dbeshi==p)
            {
                beshi=a;
                kom=b;
            }

            else
            {
                beshi=b;
                kom=q;
            }

            sieve=new long[100];

            for(i=0;i<n;i++)
            {
                sieve[i]=0;
            }

        }
    }