#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;

#define all(x)  x.begin(),x.end()
#define v(x) vector<x>
#define nl '\n'
#define fxd(x) fixed << setprecision(x)
template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    // writing input output to files
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    ll tot , c, car , road, wait , way;  cin >> tot >> c >> car >> road >> wait >> way;
    // writing the same code without the ternary operator
    // ll ans = road + ((road > c*car)? wait : ((car - road%car)%car) ) + way;

    ll ans = 0;
    ans += road;
    if(road > c*car)
    {
        ans += wait;
}       
    else
    {
        ans += (car - road%car)%car;
    }

    ans += way;

    

    if(ans > tot)
    {
        cout << "Back home";
    } 
    else
    {
        cout << "You will arrive";
    }
}