CodeForces 349A Cinema Line

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 ≤ 10⁵) — the number of people in the line. The next line contains n integers, each of them equals 25, 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".

Sample test(s)

Input

4
25 25 50 50

Output

YES

Input

2
25 100

Output

NO

Input

4
50 50 25 25

Output

NO

#include<stdio.h> 
#include<string.h>  
#include<algorithm>  
using namespace std;  
int main(){
	long int n;
	int cash25,cash50,cash100,flag,temp;
	while(scanf("%ld",&n)!=EOF){
		cash25=0;
		cash50=0;
		cash100=0;
		flag=1;
		while(n--){
			scanf("%d",&temp);
			if(temp==25){
				cash25++;
			}
			else if(temp==50){
				if(cash25>0){
					cash25--;
					cash50++;
				}
				else{
					flag=0;
				}
			}
			else if(temp==100){
				if(cash50>0&&cash25>0){
					cash50--;
					cash25--;
				}
				else if(cash25>2){
					cash25-=3;
				}
				else{
					flag=0;
				}
			}
		}
		if(flag==1){
			printf("YES\n");
		}
		else{
			printf("NO\n");
		}
	}
	return 0;
}