Codeforcess solution 1169-A A. Circle Metro Codeforcess solution

Algorithm

The circle line of the Roflanpolis subway has $n$ stations.

There are two parallel routes in the subway. The first one visits stations in order $1 \to 2 \to \dots \to n \to 1 \to 2 \to \dots$ (so the next stop after station $x$ is equal to $(x + 1)$ if $x < n$ and $1$ otherwise). The second route visits stations in order $n \to (n - 1) \to \dots \to 1 \to n \to (n - 1) \to \dots$ (so the next stop after station $x$ is equal to $(x - 1)$ if $x > 1$ and $n$ otherwise). All trains depart their stations simultaneously, and it takes exactly $1$ minute to arrive at the next station.

Two toads live in this city, their names are Daniel and Vlad.

Daniel is currently in a train of the first route at station $a$ and will exit the subway when his train reaches station $x$ .

Coincidentally, Vlad is currently in a train of the second route at station $b$ and he will exit the subway when his train reaches station $y$ .

Surprisingly, all numbers $a, x, b, y$ are distinct.

Toad Ilya asks you to check if Daniel and Vlad will ever be at the same station at the same time during their journey. In other words, check if there is a moment when their trains stop at the same station. Note that this includes the moments when Daniel or Vlad enter or leave the subway.

Input

The first line contains five space-separated integers $n$ , $a$ , $x$ , $b$ , $y$ ( $4 \leq n \leq 100$ , $1 \leq a, x, b, y \leq n$ , all numbers among $a$ , $x$ , $b$ , $y$ are distinct) — the number of stations in Roflanpolis, Daniel's start station, Daniel's finish station, Vlad's start station and Vlad's finish station, respectively.

Output

Output "YES" if there is a time moment when Vlad and Daniel are at the same station, and "NO" otherwise. You can print each letter in any case (upper or lower).

Examples
input
Copy
5 1 4 3 2
output
Copy
YES
input
Copy
10 2 1 9 10
output
Copy
NO

Note

In the first example, Daniel and Vlad start at the stations $(1, 3)$ . One minute later they are at stations $(2, 2)$ . They are at the same station at this moment. Note that Vlad leaves the subway right after that.

Consider the second example, let's look at the stations Vlad and Daniel are at. They are:

initially $(2, 9)$ ,
after $1$ minute $(3, 8)$ ,
after $2$ minutes $(4, 7)$ ,
after $3$ minutes $(5, 6)$ ,
after $4$ minutes $(6, 5)$ ,
after $5$ minutes $(7, 4)$ ,
after $6$ minutes $(8, 3)$ ,
after $7$ minutes $(9, 2)$ ,
after $8$ minutes $(10, 1)$ ,
after $9$ minutes $(1, 10)$ .

After that, they both leave the subway because they are at their finish stations, so there is no moment when they both are at the same station.

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;


#define ll long long
//#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, a, x, b, y;
  cin>>n>>a>>x>>b>>y;

  while(a != x && b != y){
    a++;
    b--;
    if(a == n+1){
      a = 1;
    }
    if( b == 0){
      b = n;
    }
    if(a == b){
      cout<<"YES"<<endl;
      return 0;
    }
  }
  cout<<"NO"<<endl;

}

Copy The Code & Try With Live Editor

Input

–

cmd

5 1 4 3 2

Output

–

cmd

YES

Demonstration

Codeforcess solution 1169-A A. Circle Metro Codeforcess solution 1169-A A. Circle Metro Codeforcess solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution

Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+

Try With Live Editor

Category - Codeforces Online Judge Maniruzzaman Akash 1 year ago 636 0