# Shortest Uncommon Subsequence

medium

1. You are given two strings S1 and S2. 2. You have to find length of the shortest subsequence in S1 which is not a subsequence in S2. 3. If no such subsequence exists, then print '-1'.

## Constraints

1 <= length of strings S1 and S2 <= 1000

## Format

### Input

Two Strings S1 and S2

### Output

A number representing the length of shortest uncommon subsequence.

## Example

Sample Input

sea
aessa

### Sample Output

2