Solve the programming task below in a Python markdown code block.
There is a sequence of words in CamelCase as a string of letters, $\boldsymbol{\mathrm{~S~}}$, having the following properties:

It is a concatenation of one or more words consisting of English letters.
All letters in the first word are lowercase. 
For each of the subsequent words, the first letter is uppercase and rest of the letters are lowercase.

Given $\boldsymbol{\mathrm{~S~}}$, determine the number of words in $\boldsymbol{\mathrm{~S~}}$.

Example 

$s=one Two Thee$  

There are $3$ words in the string: 'one', 'Two', 'Three'.  

Function Description

Complete the camelcase function in the editor below.  

camelcase has the following parameter(s):

string s: the string to analyze   

Returns  

int: the number of words in $\boldsymbol{\mathrm{~S~}}$  

Input Format

A single line containing string $\boldsymbol{\mathrm{~S~}}$.

Constraints

$1\leq\text{length of s}\leq10^5$

Sample Input
saveChangesInTheEditor

Sample Output
5

Explanation

String $\boldsymbol{\mathrm{~S~}}$ contains five words:

save
Changes
In
The
Editor

Need help? Try this problem first to get familiar with HackerRank environment.