Same Name

AtCoder

IDabc216_b

Time2000ms

Memory256MB

Difficulty—

There are $N$ people. The family name and given name of the $i$\-th person $(1 \leq i \leq N)$ are $S_i$ and $T_i$, respectively. Determine whether there is a pair of people with the same family and given names. In other words, determine whether there is a pair of integers $(i,j)$ such that $1 \leq i \lt j \leq N$, $S_i=S_j$, and $T_i=T_j$. ## Constraints * $2 \leq N \leq 1000$ * $N$ is an integer. * Each of $S_i$ and $T_i$ is a string of length between $1$ and $10$ (inclusive) consisting of English lowercase letters. ## Input Input is given from Standard Input in the following format: $N$ $S_1$ $T_1$ $S_2$ $T_2$ $\hspace{0.6cm}\vdots$ $S_N$ $T_N$ [samples]

Samples

Input #1

3
tanaka taro
sato hanako
tanaka taro

Output #1

Yes

The first and third persons have the same family and given names.

Input #2

3
saito ichiro
saito jiro
saito saburo

Output #2

No

No two persons have the same family and given names.

Input #3

4
sypdgidop bkseq
bajsqz hh
ozjekw mcybmtt
qfeysvw dbo

Output #3

No

API Response (JSON)

{
  "problem": {
    "name": "Same Name",
    "description": {
      "content": "There are $N$ people. The family name and given name of the $i$\\-th person $(1 \\leq i \\leq N)$ are $S_i$ and $T_i$, respectively. Determine whether there is a pair of people with the same family and g",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc216_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ people. The family name and given name of the $i$\\-th person $(1 \\leq i \\leq N)$ are $S_i$ and $T_i$, respectively.\nDetermine whether there is a pair of people with the same family and g...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments