#region いつもの
#pragma warning disable
using System;
using System.Collections.Generic;
using System.Linq;
using IEnumerable = System.Collections.IEnumerable;
using IEnumerator = System.Collections.IEnumerator;
using BitArray = System.Collections.BitArray;
using BigInteger = System.Numerics.BigInteger;
using TextReader = System.IO.TextReader;
using static AtCoderProject.Global;

namespace AtCoderProject
{
    static class Global
    {
        private class ComparerReverseImpl<T> : Comparer<T> where T : IComparable<T> { public override int Compare(T y, T x) => x.CompareTo(y); public override bool Equals(object obj) => obj != null && GetType() == obj.GetType(); public override int GetHashCode() => GetType().GetHashCode(); }
        public static IComparer<T> ComparerReverse<T>() where T : IComparable<T> => new ComparerReverseImpl<T>();
        public static BigInteger ParseBigInteger(string s)
        {
            // MonoのBigInteger.Parseが遅いので自前実装
            var res = BigInteger.Zero;
            var splited = new string[(s.Length + 7) / 8];
            for (int i = 0; i < splited.Length - 1; i++)
            {
                splited[i] = s.Substring(8 * i, 8);
            }
            splited[splited.Length - 1] = s.Substring(8 * (splited.Length - 1));
            foreach (var sp in splited)
            {
                res *= (int)Math.Pow(10, sp.Length);
                res += int.Parse(sp);
            }
            return res;
        }
        public static string AllLines<T>(IEnumerable<T> source) => string.Join("\n", source);
        public static string AllJoin<T>(IEnumerable<T> source) => string.Join(" ", source);
    }
    static class Ext
    {
        public static IComparer<T> Reverse<T>(this IComparer<T> comparer) => Comparer<T>.Create((x, y) => comparer.Compare(y, x));
        public static Dictionary<TKey, int> GroupCount<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector) => source.GroupBy(keySelector).ToDictionary(g => g.Key, g => g.Count());
        public static Dictionary<TKey, int> GroupCount<TKey>(this IEnumerable<TKey> source) => source.GroupCount(i => i);
    }
    public class ConsoleReader { private string[] ReadLineSplit() => textReader.ReadLine().Split(Array.Empty<char>(), StringSplitOptions.RemoveEmptyEntries); private string[] line = Array.Empty<string>(); private int linePosition; private TextReader textReader; public ConsoleReader(TextReader tr) { textReader = tr; } public int Int => int.Parse(String); public int Int0 => Int - 1; public long Long => long.Parse(String); public double Double => double.Parse(String); public string String { get { if (linePosition >= line.Length) { linePosition = 0; line = ReadLineSplit(); } return line[linePosition++]; } } public class SplitLine { private string[] splited; public SplitLine(ConsoleReader cr) { splited = cr.ReadLineSplit(); cr.line = Array.Empty<string>(); } public int[] Int => String.Select(x => int.Parse(x)).ToArray(); public int[] Int0 => String.Select(x => int.Parse(x) - 1).ToArray(); public long[] Long => String.Select(x => long.Parse(x)).ToArray(); public double[] Double => String.Select(x => double.Parse(x)).ToArray(); public string[] String => splited; } public SplitLine Split => new SplitLine(this); public class RepeatReader : IEnumerable<ConsoleReader> { ConsoleReader cr; int count; public RepeatReader(ConsoleReader cr, int count) { this.cr = cr; this.count = count; } public IEnumerator<ConsoleReader> GetEnumerator() => Enumerable.Repeat(cr, count).GetEnumerator(); System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() => GetEnumerator(); public IEnumerable<string> String => this.Select(cr => cr.String); public IEnumerable<int> Int => this.Select(cr => cr.Int); public IEnumerable<int> Int0 => this.Select(cr => cr.Int - 1); public IEnumerable<long> Long => this.Select(cr => cr.Long); public IEnumerable<double> Double => this.Select(cr => cr.Double); } public RepeatReader Repeat(int count) => new RepeatReader(this, count); }
    public class Program
    {
        [System.Diagnostics.DebuggerBrowsable(System.Diagnostics.DebuggerBrowsableState.Never)] private ConsoleReader consoleReader;
        public Program(ConsoleReader consoleReader) { this.consoleReader = consoleReader; }
        static void Main() => Console.WriteLine(new Program(new ConsoleReader(Console.In)).Calc());

        #endregion
        public object Calc()
        {
            var T1 = consoleReader.Int;
            var T2 = consoleReader.Int;
            var A1 = consoleReader.Long;
            var A2 = consoleReader.Long;
            var B1 = consoleReader.Long;
            var B2 = consoleReader.Long;

            if (A1 * T1 + A2 * T2 == B1 * T1 + B2 * T2) return "infinity";

            long count = 0;

            long lead;
            long tume;
            if (A1 > B1)
            {
                lead = (A1 - B1) * T1;
                tume = (B2 - A2) * T2;
            }
            else
            {
                lead = (B1 - A1) * T1;
                tume = (A2 - B2) * T2;
            }

            if (lead > tume) return 0;

            long amari;
            var x = Math.DivRem(lead , (tume - lead), out amari);
            var res = x * 2;
            if (amari != 0) res++;

            return res;
        }

        struct Mod : IEquatable<Mod>
        {
            public const long mod = 1000000007;
            public readonly long val;
            public Mod(long val) { this.val = val; }
            public override bool Equals(object obj) => (obj is Mod) ? this == ((Mod)obj) : false;
            public bool Equals(Mod obj) => this == obj;
            public override int GetHashCode() => val.GetHashCode();
            public override string ToString() => val.ToString();
            public static implicit operator Mod(long x) => new Mod(x);
            public static Mod operator +(Mod x, Mod y) => (x.val + y.val) % mod;
            public static Mod operator -(Mod x, Mod y) => x.val >= y.val ? (x.val - y.val) % mod : (x.val - y.val) % mod + mod;
            public static Mod operator *(Mod x, Mod y) => (x.val * y.val) % mod;
            public static Mod operator /(Mod x, Mod y) => x * y.Inverse();
            public static bool operator ==(Mod x, Mod y) => x.val == y.val;
            public static bool operator !=(Mod x, Mod y) => x.val != y.val;
            public Mod Inverse()
            {
                long a = val, b = mod, u = 1, v = 0;
                while (b > 0)
                {
                    long t = a / b;
                    var b2 = a - t * b;
                    a = b; b = b2;
                    var v2 = u - t * v;
                    u = v; v = v2;
                }
                u %= mod;
                if (u < 0) u += mod;
                return u;
            }
            public static Mod Pow(Mod x, int y)
            {
                Mod res = 1;
                for (; y > 0; y >>= 1)
                {
                    if ((y & 1) == 1) res *= x;
                    x *= x;
                }
                return res;
            }

            public static Factor CreateFactor(int max) => new Factor(max);
            public class Factor
            {
                private readonly Mod[] fac, finv;
                public Factor(int max)
                {
                    ++max;
                    var inv = new Mod[max];
                    fac = new Mod[max]; finv = new Mod[max];
                    fac[0] = fac[1] = 1;
                    finv[0] = finv[1] = 1;
                    inv[1] = 1;
                    for (int i = 2; i < max; i++)
                    {
                        fac[i] = fac[i - 1] * i;
                        inv[i] = mod - inv[mod % i].val * (mod / i) % mod;
                        finv[i] = finv[i - 1] * inv[i];
                    }
                }

                // 二項係数計算
                public Mod Combine(int n, int k)
                {
                    if (n < k) return 0;
                    if (n < 0 || k < 0) return 0;
                    return fac[n] * finv[k] * finv[n - k];
                }

                public Mod Factorial(int n) => fac[n];
                public Mod FactorialInvers(int n) => finv[n];
            }
        }

    }
}


Measured memory_bytes: 13268