The Modcrab

Vova is again playing some computer game, now an RPG. In the game Vova's character received a quest: to slay the fearsome monster called Modcrab.

After two hours of playing the game Vova has tracked the monster and analyzed its tactics. The Modcrab has h₂ health points and an attack power of a₂. Knowing that, Vova has decided to buy a lot of strong healing potions and to prepare for battle.

Vova's character has h₁ health points and an attack power of a₁. Also he has a large supply of healing potions, each of which increases his current amount of health points by c₁ when Vova drinks a potion. All potions are identical to each other. It is guaranteed that c₁ > a₂.

The battle consists of multiple phases. In the beginning of each phase, Vova can either attack the monster (thus reducing its health by a₁) or drink a healing potion (it increases Vova's health by c₁; Vova's health can exceed h₁). Then, if the battle is not over yet, the Modcrab attacks Vova, reducing his health by a₂. The battle ends when Vova's (or Modcrab's) health drops to 0 or lower. It is possible that the battle ends in a middle of a phase after Vova's attack.

Of course, Vova wants to win the fight. But also he wants to do it as fast as possible. So he wants to make up a strategy that will allow him to win the fight after the minimum possible number of phases.

Help Vova to make up a strategy! You may assume that Vova never runs out of healing potions, and that he can always win.

Input

The first line contains three integers h₁, a₁, c₁ (1 ≤ h₁, a₁ ≤ 100, 2 ≤ c₁ ≤ 100) — Vova's health, Vova's attack power and the healing power of a potion.

The second line contains two integers h₂, a₂ (1 ≤ h₂ ≤ 100, 1 ≤ a₂ < c₁) — the Modcrab's health and his attack power.

Output

In the first line print one integer n denoting the minimum number of phases required to win the battle.

Then print n lines. i-th line must be equal to HEAL if Vova drinks a potion in i-th phase, or STRIKE if he attacks the Modcrab.

The strategy must be valid: Vova's character must not be defeated before slaying the Modcrab, and the monster's health must be 0 or lower after Vova's last action.

If there are multiple optimal solutions, print any of them.

Examples

Input

10 6 100
17 5

Output

4
STRIKE
HEAL
STRIKE
STRIKE

Input

11 6 100
12 5

Output

2
STRIKE
STRIKE

Note

In the first example Vova's character must heal before or after his first attack. Otherwise his health will drop to zero in 2 phases while he needs 3 strikes to win.

In the second example no healing needed, two strikes are enough to get monster to zero health and win with 6 health left.

Vova再次玩一些电脑游戏，现在一个RPG。在游戏中Vova的角色接受任务：杀死怪物叫Modcrab。经过两个小时的玩游戏，Vova已找到怪物并分析其策略。Modcrab H2健康点和A2的攻击力。要知道，Vova已经决定买很多强大的治疗药水和准备战斗。Vova的性格中有H1健康点和A1的攻击力。他也有大量的治疗药剂，分别增加电流量健康点C1当Vova喝药水。所有药水都是一样的。这是保证C1 > A2。战斗由多个阶段组成。在每一个阶段的开始，Vova可以攻击怪物（A1从而降低其健康）或喝药水（增加Vova的健康由C1；Vova的健康可以超过H1）。然后，如果战斗还没有结束，这modcrab攻击Vova，A2减少他的健康。战争结束时，Vova（或Modcrab）健康下降到0或更低。这是可能的，战斗结束在中间的一个阶段，Vova的攻击后。
当然，Vova想要赢得这场战斗。但他也希望尽可能快地完成它。所以他想制定一个策略，让他在尽可能少的几个阶段赢得战斗。
帮助Vova制定策略！你可能会认为Vova从来没有用完的治疗药剂，而他总是能赢。

思路：

如果下次决斗不能被怪兽打死就可以不喝药水~~·，如果能被打死就得先喝药水

代码：

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10005;
int arr[N];
int main(){
	int h1,a1,c1;
	int h2,a2;
	cin>>h1>>a1>>c1;
	cin>>h2>>a2;
    int cnt=0;
    while(h2>0){
    	if(h1<=a2&&a1<h2){
    		arr[cnt++]=1;
    		h1+=c1;
    		h1-=a2;
		}
		else{
			arr[cnt++]=2;
			h2-=a1;
			h1-=a2;
		}
	}
	cout<<cnt<<endl;
	for(int i=0;i<cnt;i++){
		if(arr[i]==1) cout<<"HEAL"<<endl;
		else if(arr[i]==2) cout<<"STRIKE"<<endl;
	}
	return 0;
}