Current leadership election algorithms do not explicitly plan for the failure of the leader, and thus must do system wide elections each time a leader fails. To this end we propose an algorithm that removes the need for system wide elections after a leadership failure. Our technique has an initial system wide election to elect a leader, and after the leader is confirmed chooses subordinates with which to form a clique. After the failure of the leader a subordinate assumes the leaders position, and a new subordinate is selected to take the vacated place.