http://codeforces.com/contest/349

A. Cinema Line

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The new "Die Hard" movie has just been released! There are n people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 ruble bill. A "Die Hard" ticket costs 25 rubles. Can the booking clerk sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of people in the line. The next line contains n integers, each of them equals25, 50 or 100 — the values of the bills the people have. The numbers are given in the order from the beginning of the line (at the box office) to the end of the line.

Output

Print "YES" (without the quotes) if the booking clerk can sell a ticket to each person and give the change. Otherwise print "NO".

Examples

input

4
25 25 50 50

output

YES

input

2
25 100

output

NO

input

4
50 50 25 25

output

NO

简介：买电影票一张25一张，然后营业员最初没有钱，给你一个只有25 ，50，100的数列，问能否成功卖票，成功输出“yes”否则输出“NO”

题解：直接模拟,x代表25的票数y代表50的票数z代表100的票数

代码如下：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=1e5+5; 
int a[maxn];
int x,y,z,n; 
int main()
{
    scanf("%d",&n);
    int flag=true;
    x=y=z=0; 
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        if(flag) 
        {
            if(a[i]==25)
            {
                x++; 
            }
            else if(a[i]==50) 
            {
                y++;
                if(x>=1)
                {
                    x--; 
                }
                else
                {
                    flag=false; 
                } 
            } 
            else 
            {
                z++; 
                if(y>=1&&x>=1)
                {
                    y--;
                    x--; 
                }
                else if(x>=3) 
                {
                    x=x-3; 
                } 
                else
                {
                    flag=false; 
                } 
            } 
            
        } 
        
    } 
    if(flag)
    {
        cout<<"YES
"; 
    } 
    else
    {
        cout<<"NO
"; 
    } 
} 

题目连接http://codeforces.com/contest/349/problem/A