import java.util.Scanner;

public class Main73 {
	public static void main(String[] args) {
		Main73 p = new Main73();
	}

	public Main73() {
		Scanner sc = new Scanner(System.in);
		
		long[] c = new long[26];
		for (int i = 0; i < c.length; i++) 
			c[i] = sc.nextLong();
		
		solve(c);
		
	}

	public void solve(long[] c) {
		long res = 0;
		
		if(c['h'-'a']>0 && c['e'-'a'] > 0 && c['l'-'a'] > 2 && c['o'-'a'] > 1 && c['w'-'a'] > 0 && c['r'-'a'] > 0 && c['d'-'a'] > 0)		
			res = c['h'-'a'] * c['e'-'a'] * lcalc(c['l'-'a']) 
					* ocalc(c['o'-'a']) * c['w'-'a'] * c['r'-'a']* c['d'-'a'];
		
		System.out.println(res);
	}
	
	private long lcalc(long n){
		long m = 0;
		for(int i=1;i<n;i++){
			m = Math.max(m, (n-i)*(n-i-1)/2 * i);
		}
		
		return m;
	}
	
	private long ocalc(long n){
		long m = 0;
		for(int i=1;i<n;i++){
			m = Math.max(m, (n-i)*i);
		}
		
		return m;
	}
	
	

}